常数复合码的加细强逆
Refined Strong Converse for the Constant Composition Codes
摘要：
通过Augustin信息和Augustin平均的概念，使用Berry-Esseen定理建立了形式为$P_{e}^{(n)} \geq 1- A n^{-0.5(1-E_{sc}'(R,W,p))} e^{-n E_{sc}(R,W,p)}$的常数复合码的强逆界，其中$A$是由信道$W$、复合$p$和速率$R$确定的常数，即，$A$不依赖于块长度$n$。
英文摘要：
A strong converse bound for constant composition codes of the form $P_{e}^{(n)} \geq 1- A n^{-0.5(1-E_{sc}'(R,W,p))} 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$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
