Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes

DOI10.1109/TIT.2007.911177MaRDI QIDQ3604480zbMATH OpenFDO

Authors Fangwei Fu, Shutaong Xia

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

fundamental conepseudocodewordslow-density parity-check (LDPC) codeslinear programming (LP) decodingpseudoweight stopping sets

Mathematics Subject Classification ID

Linear programming (90C05) Decoding (94B35)

Recommendations

• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
• LP Decoding Corrects a Constant Fraction of Errors
• Minimum distance and pseudodistance lower bounds for generalised LDPC codes
• Eigenvalue bounds on the pseudocodeword weight of expander codes
• Using Linear Programming to Decode Binary Linear Codes

Cited in

(7)

• Pseudocodeword-free criterion for codes with cycle-free Tanner graph
• New results on the pseudoredundancy
• Two classes of LDPC codes from the space of Hermitian matrices over finite fields
• Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
• Minimum distance and pseudodistance lower bounds for generalised LDPC codes
• On linear programming decoding on a quantized additive white Gaussian noise channel
• On the minimum weights of binary LCD codes and ternary LCD codes

This page was built for publication: Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604480)