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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages826-830
Number of pages5
DOIs
StatePublished - Oct 22 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period7/1/127/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The log-volume of optimal constant-composition codes for memoryless channels, within O(1) bits'. Together they form a unique fingerprint.

Cite this