Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections
From MaRDI portal
Publication:2986194
DOI10.1109/TIT.2014.2322033zbMATH Open1360.94212DBLPjournals/tit/ScarlettPMMF14arXiv1307.6679OpenAlexW3102287958WikidataQ63957291 ScholiaQ63957291MaRDI QIDQ2986194FDOQ2986194
Authors: Jonathan Scarlett, Li Peng, Neri Merhav, Alfonso Martinez, Albert Guillen i Fabregas 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and non-asymptotic bounds on the error probability for an arbitrary codeword distribution. A simple non-asymptotic bound is shown to attain an exponent of Csisz'ar and K"orner under constant-composition coding. Using Lagrange duality, this exponent is expressed in several forms, one of which is shown to permit a direct derivation via cost-constrained coding which extends to infinite and continuous alphabets. The method of type class enumeration is studied, and it is shown that this approach can yield improved exponents and better tightness guarantees for some codeword distributions. A generalization of this approach is shown to provide a multi-letter exponent which extends immediately to channels with memory. Finally, a refined analysis expurgated i.i.d. random coding is shown to yield a O�ig(frac{1}{sqrt{n}}�ig) prefactor, thus improving on the standard O(1) prefactor. Moreover, the implied constant is explicitly characterized.
Full work available at URL: https://arxiv.org/abs/1307.6679
This page was built for publication: Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986194)
