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

page 1

page 2

page 3

page 4

research
02/26/2020

Refined Strong Converse for the Constant Composition Codes

A strong converse bound for constant composition codes of the form P_e^(...
research
01/02/2019

Generalized Sphere-Packing Bound for Subblock-Constrained Codes

We apply the generalized sphere-packing bound to two classes of subblock...
research
04/17/2018

The Sphere Packing Bound For Memoryless Channels

Sphere packing bounds (SPBs) ---with prefactors that are polynomial in t...
research
03/05/2022

Why Constant-Composition Codes Reduce Nonlinear Interference Noise

A time-domain perturbation model of the nonlinear Schrodinger equation i...
research
08/01/2019

First Experimental Demonstration of Probabilistic Enumerative Sphere Shaping in Optical Fiber Communications

We transmit probabilistic enumerative sphere shaped dual-polarization 64...
research
01/27/2021

Non-Asymptotic Converse Bounds Via Auxiliary Channels

This paper presents a new derivation method of converse bounds on the no...
research
07/03/2019

Enumerative Sphere Shaping for Rate Adaptation and Reach Increase in WDM Transmission Systems

The performance of enumerative sphere shaping (ESS), constant compositio...

Please sign up or login with your details

Forgot password? Click here to reset