Title
Refinement of the Sphere-Packing Bound: Asymmetric Channels
Abstract
We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the subexponential factor in front of the exponent. The order of our subexponential factor is $\Omega (N^{-0.5(1+\epsilon+\rho_{R}^{\ast})})$ for any $\epsilon>0$, where $\rho_{R}^{\ast}$ is the left derivative of the sphere-packing exponent at rate $R$ and $N$ is the blocklength.
Year
DOI
Venue
2014
10.1109/TIT.2014.2299275
IEEE Transactions on Information Theory
Keywords
DocType
Volume
block codes,memoryless systems,asymmetric channel,asymmetric discrete memoryless channels,constant composition codes,sphere packing bound,sphere packing exponent,Channel coding,error exponents,exact asymptotics,sub-exponential factor
Journal
60
Issue
ISSN
Citations 
3
0018-9448
1
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Yucel Altug1778.76
Aaron B. Wagner232237.39