Loading [a11y]/accessibility-menu.js
On the minimum pseudo-codewords of LDPC codes | IEEE Journals & Magazine | IEEE Xplore

On the minimum pseudo-codewords of LDPC codes


Abstract:

In this letter, we study the minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. We show that a lower bound of Chaic...Show More

Abstract:

In this letter, we study the minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. We show that a lower bound of Chaichanavong and Siegel on the pseudo-weight of a pseudo-codeword is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using this result we further show that for some LDPC codes, e.g., Euclidean plane and projective plane LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords.
Published in: IEEE Communications Letters ( Volume: 10, Issue: 5, May 2006)
Page(s): 363 - 365
Date of Publication: 31 May 2006

ISSN Information:


References

References is not available for this document.