Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
From MaRDI portal
Publication:3604480
DOI10.1109/TIT.2007.911177zbMATH Open1304.94123MaRDI QIDQ3604480FDOQ3604480
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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
fundamental conepseudocodewordslow-density parity-check (LDPC) codeslinear programming (LP) decodingpseudoweight stopping sets
Cited In (5)
- On the minimum weights of binary LCD codes and ternary LCD codes
- Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
- On linear programming decoding on a quantized additive white Gaussian noise channel
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
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)
