2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | S.5.4 | ||
| Paper Title | Refined Strong Converse for the Constant Composition Codes | ||
| Authors | Hao-Chung Cheng, University of Cambridge, United Kingdom; Barış Nakiboğlu, Middle East Technical University, Turkey | ||
| Session | S.5: Error Exponents | ||
| Presentation | Lecture | ||
| Track | Shannon Theory | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | A strong converse bound for constant composition codes of the form $P_{e}^{(n)}≥1−A n^{−0.5(1−E_{sc}'(R,W,p))} e^{−nE_{ sc}(R,W,p)}$ is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mean, where A is a constant determined by the channel W, the composition p, and the rate R, i.e., A does not depend on the block length n. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
