Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over binary erasure channels

We present Kovalenko's full-rank limit as a tight probabilistic lower bound for error performances of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a tight lower-bound for stable overheads for successful maximum-likelihood decoding of the codes.

[1]  V. F. Kolchin,et al.  Random Graphs: Contents , 1998 .

[2]  Colin Cooper.  On the rank of random matrices , 2000 .

[3]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[4]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[5]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[6]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[7]  Colin Cooper,et al.  On the rank of random matrices , 2000, Random Struct. Algorithms.

[8]  Igor N. Kovalenko,et al.  On the Limit Distribution of the Number of Solutions of a Random System of Linear Equations in the Class of Boolean Functions , 1967 .

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

[10]  Hua Xiao,et al.  Improved progressive-edge-growth (PEG) construction of irregular LDPC codes , 2004, IEEE Communications Letters.

[11]  Ki-Moon Lee.  LT Codes from an Arranged Encoder Matrix and Degree Distribution Design with Dense Rows , 2007 .

[12]  Amin Shokrollahi,et al.  Capacity-achieving sequences for the erasure channel , 2002, IEEE Trans. Inf. Theory.

[13]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.