Analytic Determination of Scaling Parameters

We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to "covariance evolution". We provide simple expressions that can be evaluated using solely the degree distributions and the characteristics of the fixed point of density evolution

[1]  Andrea Montanari,et al.  Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes , 2004, ArXiv.

[2]  Alon Orlitsky,et al.  Finite-length analysis of LDPC codes with large left degrees , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[4]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[5]  Andrea Montanari,et al.  Finite-length scaling of irregular LDPC code ensembles , 2005, IEEE Information Theory Workshop, 2005..