Efficient Linear Programming Decoding of HDPC Codes
arXiv:0912.3907 · doi:10.1109/TCOMM.2011.122110.090729
Abstract
We propose several improvements for Linear Programming (LP) decoding algorithms for High Density Parity Check (HDPC) codes. First, we use the automorphism groups of a code to create parity check matrix diversity and to generate valid cuts from redundant parity checks. Second, we propose an efficient mixed integer decoder utilizing the branch and bound method. We further enhance the proposed decoders by removing inactive constraints and by adapting the parity check matrix prior to decoding according to the channel observations. Based on simulation results the proposed decoders achieve near-ML performance with reasonable complexity.
Submitted to the IEEE Transactions on Communications, November 2009
References in corpus (4)
Cited by in corpus (7)
- Deep Learning Methods for Improved Decoding of Linear Codes
- The ADMM penalized decoder for LDPC codes
- RNN Decoding of Linear Block Codes
- Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
- Efficient QP-ADMM Decoder for Binary LDPC Codes and Its Performance Analysis
- Optimization by Decoded Quantum Interferometry
- LP-decodable multipermutation codes