论文信息 - On the Distance Spectrum of Tail-Biting Repeat-Accumulate Codes

On the Distance Spectrum of Tail-Biting Repeat-Accumulate Codes

In this letter the impact of tail-biting (TB) on the distance spectrum of repeat accumulate (RA) codes is analyzed. The average weight enumerator (WE) functions for RA ensembles with and without TB are derived, showing that in the short and moderate block length regimes TB is effective in reducing the multiplicities of low weight codewords. Finally, the asymptotic case is discussed.

Gianluigi Liva | Balázs Matuz | G. Liva | B. Matuz

[1] Robert J. McEliece,et al. RA Codes Achieve AWGN Channel Capacity , 1999, AAECC.

[2] H. Jin,et al. Irregular repeat accumulate codes , 2000 .

[3] David Burshtein,et al. Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.

[4] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .

[5] Marco Chiani,et al. Pivoting Algorithms for Maximum Likelihood Decoding of LDPC Codes over Erasure Channels , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

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

[7] Jack K. Wolf,et al. On the weight distribution of linear block codes formed from convolutional codes , 1996, IEEE Trans. Commun..

[8] Yifei Zhang,et al. Structured IRA Codes: Performance Analysis and Construction , 2007, IEEE Transactions on Communications.

[9] Daniel A. Spielman,et al. Practical loss-resilient codes , 1997, STOC '97.

[10] R. M. Tanner. On Quasi-Cyclic Repeat-Accumulate Codes , 2000 .

[11] Marco Chiani,et al. Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding , 2008, IEEE Communications Letters.

[12] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.