CUED Publications database

Expurgated random-coding ensembles: Exponents, refinements, and connections

Scarlett, J and Peng, L and Merhav, N and Martinez, A and Guillén I Fàbregas, A (2014) Expurgated random-coding ensembles: Exponents, refinements, and connections. IEEE Transactions on Information Theory, 60. pp. 4449-4462. ISSN 0018-9448

Full text not available from this repository.

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 nonasymptotic bounds on the error probability for an arbitrary codeword distribution. A simple nonasymptotic bound is shown to attain an exponent of Csiszár and Körner 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 that 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 multiletter exponent that extends immediately to channels with memory. © 2014 IEEE.

Item Type: Article
Subjects: UNSPECIFIED
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:16
Last Modified: 19 Sep 2017 01:30
DOI: