Refined Strong Converse for the Constant Composition Codes
Journal
IEEE International Symposium on Information Theory - Proceedings
Journal Volume
2020-June
Pages
2149-2154
Date Issued
2020
Author(s)
Nakiboglu B.
Abstract
A strong converse bound for constant composition codes of the form Pe(n)?1 - An- 0.5(1 - E'sc (R,W,p)e - nEsc(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. ? 2020 IEEE.
Subjects
Information theory; Block lengths; Constant composition codes; Strong converse; Codes (symbols)
SDGs
Type
conference paper