TY - GEN

T1 - The log-volume of optimal constant-composition codes for memoryless channels, within O(1) bits

AU - Moulin, Pierre

PY - 2012/10/22

Y1 - 2012/10/22

N2 - This paper derives a tight asymptotic upper bound on the maximum volume M * cc(n, ∈) of length-n constant-composition codes subject to an average decoding error probability ∈: M bb(n, ∈) = exp{nC - √nV Φ - (1 - ∈) + 1/2 log n + A n, ∈ + o(1)} where Φ is the cdf of the standard normal distribution, and A n, ∈ is a bounded sequence that can be explicitly identified and reduces to a constant in the nonlattice case. A lower bound is presented, differing from the upper bound by an easily computable multiplying constant. These expressions hold under certain regularity assumptions on the channel.

AB - This paper derives a tight asymptotic upper bound on the maximum volume M * cc(n, ∈) of length-n constant-composition codes subject to an average decoding error probability ∈: M bb(n, ∈) = exp{nC - √nV Φ - (1 - ∈) + 1/2 log n + A n, ∈ + o(1)} where Φ is the cdf of the standard normal distribution, and A n, ∈ is a bounded sequence that can be explicitly identified and reduces to a constant in the nonlattice case. A lower bound is presented, differing from the upper bound by an easily computable multiplying constant. These expressions hold under certain regularity assumptions on the channel.

UR - http://www.scopus.com/inward/record.url?scp=84867543546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867543546&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6284676

DO - 10.1109/ISIT.2012.6284676

M3 - Conference contribution

AN - SCOPUS:84867543546

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 826

EP - 830

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -