Please use this identifier to cite or link to this item:
Title: On the minimum pseudo-codewords of LDPC codes
Authors: Xia, S.-T.
Fu, F.-W. 
Keywords: Fundamental cone
Linear programming (LP) decoding
Low-density parity-check (LDPC) codes
Issue Date: May-2006
Citation: Xia, S.-T., Fu, F.-W. (2006-05). On the minimum pseudo-codewords of LDPC codes. IEEE Communications Letters 10 (5) : 363-365. ScholarBank@NUS Repository.
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. © 2006 IEEE.
Source Title: IEEE Communications Letters
ISSN: 10897798
DOI: 10.1109/LCOMM.2006.1633324
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.