Reweighted LP Decoding for LDPC Codes

DOI10.1109/TIT.2012.2202211MaRDI QIDQ2989791zbMATH OpenOpenAlexFDO

Authors M. Amin Khajehnejad, Alexandros G. Dimakis, Benjamin Vigoda, William T. Bradley, B. Hassibi

Publication date 8 June 2017

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

Full work available at URL https://arxiv.org/abs/1103.2837

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear codes (general theory) (94B05) Decoding (94B35)

Abstract: We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a post-processing step that solves a second linear program that reweights the objective function based on the outcome of the original LP decoder output. Our analysis shows that for some LDPC ensembles we can improve the provable threshold guarantees compared to standard LP decoding. We also show significant empirical performance gains for the reweighted LP decoding algorithm with very small additional computational complexity.

Recommendations

• scientific article; zbMATH DE number 6263253
• LP Decoding of Regular LDPC Codes in Memoryless Channels
• Weighted Reed-Muller codes revisited
• Efficient decoding implementations of LDPC codes
• An offset adjustment based weighted bit-flipping decoding algorithm for LDPC codes
• A joint decoding algorithm of LDPC codes
• Iterative decoding of LDPC codes: some bounds and properties
• Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
• Using linear programming to decode LDPC codes
• Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

Cited in

(1)

• scientific article; zbMATH DE number 6263253 (Why is no real title available?)

This page was built for publication: Reweighted LP Decoding for LDPC Codes

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