A Simple Derivation of the Refined SPB for the Constant Composition Codes
2019
A judicious application of the Berry-Esseen theorem via the concepts of Augustin information and mean is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is $\mathit{\Omega}\left(n^{-0.5(1-E_{sp}'(R,W,p))}\right)$ for the constant composition codes. The resulting non-asymptotic bounds have definite approximation error terms.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
26
References
0
Citations
NaN
KQI