Eigenvalue bounds on the pseudocodeword weight of expander codes

Autor: Kelley, Christine A., Sridhara, Deepak
Rok vydání: 2007
Předmět:
Zdroj: Journal on Advances of Mathematics of Communications, vol. 1, no. 3, pp. 287 -- 307, Aug. 2007
Druh dokumentu: Working Paper
Popis: Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived. These bounds are compared with the known eigenvalue-based lower bounds on the minimum distance of expander codes. Furthermore, Tanner's parity-oriented eigenvalue lower bound on the minimum distance is generalized to yield a new lower bound on the minimum pseudocodeword weight. These bounds are useful in predicting the performance of LDPC codes under graph-based iterative decoding and linear programming decoding.
Comment: Journal on Advances of Mathematics of Communications, vol. 1, no. 3, pp. 287 -- 307, Aug. 2007
Databáze: arXiv