Soft-covering via Constant-composition Superposition codes
| Autor: | Sreejith Sreekumar, Ziv Goldfeld |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Constraint (information theory)
Superposition principle Encoding (memory) Exponent Applied mathematics Data_CODINGANDINFORMATIONTHEORY Characterization (mathematics) Average cost Computer Science::Cryptography and Security Computer Science::Information Theory Communication channel Coding (social sciences) Mathematics |
| Zdroj: | ISIT |
| Popis: | We consider the problem of soft-covering with constant composition superposition codes and characterize the optimal soft-covering exponent. A double-exponential concentration bound for deviation of the exponent from its mean is also established. We demonstrate an application of the result to achieving the secrecy-capacity region of a broadcast channel with confidential messages under a per-codeword cost constraint. This generalizes the recent characterization of the wiretap channel secrecy-capacity under an average cost constraint, highlighting the potential utility of the superposition soft-covering result to the analysis of coding problems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|