A Simple Derivation of the Refined SPB for the Constant Composition Codes

04/29/2019
by   Barış Nakiboğlu, et al.
0

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 Ω(n^-0.5(1-E_sp'(R,W,p))) for the constant composition codes. The resulting non-asymptotic bounds have definite approximation error terms.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro