On Asymptotic Ensemble Weight Enumerators of Multi-Edge Type Codes

In this paper, we investigate the asymptotic ensemble weight enumerators of multi-edge type codes whose component codes are arbitrary block codes. Two forms of asymptotic growth rate of codewords, corresponding to the primal and dual problems, are obtained. Furthermore, for the codewords of small linear-sized weights, we develop a simplification method to restrict the search space of the primal problem and study the optimality conditions of the dual problem, giving a first-order approximation of the growth rate and a condition of exponentially few small weight codewords.

[1]  D. Divsalar,et al.  Ensemble Weight Enumerators for Protograph-Based Generalized LDPC Codes , 2007, 2007 Information Theory and Applications Workshop.

[2]  Marc P. C. Fossorier,et al.  Doubly Generalized LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[3]  Shu Lin,et al.  Error Control Coding , 2004 .

[4]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[5]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[6]  Jung-Fu Cheng,et al.  Some High-Rate Near Capacity Codecs for the Gaussian Channel , 1996 .

[7]  David Burshtein,et al.  Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.

[8]  Dariush Divsalar,et al.  Ensemble Weight Enumerators for Protograph LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[9]  Ayoub Otmani,et al.  On the Minimum Distance of Generalized LDPC Codes , 2007, 2007 IEEE International Symposium on Information Theory.

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

[11]  David Declercq,et al.  Weight distributions of multi-edge type LDPC codes , 2009, ISIT.

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[14]  Marc P. C. Fossorier,et al.  Ensemble weight enumerators for protograph-based doubly generalized LDPC codes , 2008, 2008 IEEE International Symposium on Information Theory.

[15]  Rüdiger L. Urbanke,et al.  Weight Distribution of Low-Density Parity-Check Codes , 2006, IEEE Transactions on Information Theory.

[16]  J. Boutros,et al.  Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[17]  Marc P. C. Fossorier,et al.  On asymptotic ensemble weight enumerators of LDPC-like codes , 2009, IEEE Journal on Selected Areas in Communications.

[18]  Jeremy Thorpe,et al.  Enumerators for protograph ensembles of LDPC codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[19]  Marco Chiani,et al.  On the Growth Rate of the Weight Distribution of Irregular Doubly Generalized LDPC Codes , 2008, IEEE Transactions on Information Theory.

[20]  Michael Lentmaier,et al.  On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices , 2005, Probl. Inf. Transm..