On Random-Coding Union Bounds With and Without Erasures

Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound of Polyanskiy et al. is improved by carefully taking ties (equal likelihood scores) into account. It is shown that the improved bound is always better than threshold-decoding based bounds. The framework is extended to the case of decoding with an erasure option, deriving several achievability bounds in the same spirit. In order to exemplify the merits of the approach, the bounds are evaluated for the case of pairwise-independent uniformly-distributed ensembles (e.g., shifted random linear codes).

[1]  Masahito Hayashi,et al.  Quantum Information: An Introduction , 2010 .

[2]  Masahito Hayashi.  Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding , 2006, quant-ph/0611013.

[3]  Amiel Feinstein,et al.  A new basic theorem of information theory , 1954, Trans. IRE Prof. Group Inf. Theory.

[4]  Albert Guillén i Fàbregas,et al.  Random-coding bounds for threshold decoders: Error exponent and saddlepoint approximation , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Meir Feder,et al.  Random coding techniques for nonrandom codes , 1999, IEEE Trans. Inf. Theory.

[6]  Gérald E. Séguin.  Linear ensembles of codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[7]  Neri Merhav,et al.  Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators , 2007, IEEE Transactions on Information Theory.

[8]  Albert Guillén i Fàbregas,et al.  The saddlepoint approximation: Unified random coding asymptotics for fixed and varying rates , 2014, 2014 IEEE International Symposium on Information Theory.

[9]  Vincent Y. F. Tan,et al.  Second- and Higher-Order Asymptotics For Erasure and List Decoding , 2014, ArXiv.

[10]  Masahito Hayashi,et al.  General formulas for capacity of classical-quantum channels , 2003, IEEE Transactions on Information Theory.

[11]  Albert Guillén i Fàbregas,et al.  Saddlepoint approximation of random-coding bounds , 2011, 2011 Information Theory and Applications Workshop.

[12]  Neri Merhav,et al.  Exact Random Coding Exponents for Erasure Decoding , 2011, IEEE Transactions on Information Theory.

[13]  Adrià Tauste Campo,et al.  Random-coding joint source-channel bounds , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[14]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[15]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[16]  U. Erez,et al.  Tie breaking for singular channels is worth 1 Nat , 2014, 2014 IEEE 28th Convention of Electrical & Electronics Engineers in Israel (IEEEI).

[17]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[18]  Aaron B. Wagner,et al.  The third-order term in the normal approximation for singular channels , 2013, 2014 IEEE International Symposium on Information Theory.

[19]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[20]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.