Multistep linear programming approaches for decoding low-density parity-check codes

DOI10.1016/S1007-0214(09)70117-8MaRDI QIDQ3054275zbMATH OpenOpenAlexFDO

Authors Haiyang Liu, Lianrong Ma, Jie Chen

Publication date 5 November 2010

Published in Tsinghua Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1007-0214(09)70117-8

zbMATH Keywords

low-density parity-check codespseudocode-word

Mathematics Subject Classification ID

Linear programming (90C05) Other types of codes (94B60)

Recommendations

• Using linear programming to decode LDPC codes
• Using Linear Programming to Decode Binary Linear Codes
• Adaptive Methods for Linear Programming Decoding
• Message passing algorithms and improved LP decoding
• Decoding turbo-like codes via linear programming

Cited in

(10)

• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
• Using linear programming to decode LDPC codes
• Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
• Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
• Adaptive Methods for Linear Programming Decoding
• On a necessary condition for L-step orthogonalization of linear codes and its applications
• A branch-cut-and-price algorithm for optimal decoding in digital communication systems
• Monotonic optimization based decoding for linear codes
• Linear Programming Decoding of Spatially Coupled Codes
• A New Linear Programming Approach to Decoding Linear Block Codes

This page was built for publication: Multistep linear programming approaches for decoding low-density parity-check codes

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