A strong converse bound for constant composition codes of the form $P_{mathbf{e}}^{(n)} geq 1 - A{n^{ - 0.5left( {1 - E_{sc}^prime (R,W,p)} ight)}}{e^{ - n{E_{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.
展开▼
机译：格式为$ P _ {\ mathbf {e}} ^ {（n）} \ geq 1-A {n ^ {-0.5 \ left（{1-E_ {sc} ^ \ prime （R，W，p）} \ right）}} {e ^ {-n {E_ {sc}}（R，W，p）}} $是使用Berry–Esseen定理通过奥古斯丁信息和奥古斯丁均值，其中A是由通道W，组成p和速率R确定的常数，即A不取决于块长度n。
展开▼
