Efficient Linear Programming Decoding of HDPC Codes
Information Theory
2016-11-18 v1 math.IT
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.
Cite
@article{arxiv.0912.3907,
title = {Efficient Linear Programming Decoding of HDPC Codes},
author = {Alex Yufit and Asi Lifshitz and Yair Be'ery},
journal= {arXiv preprint arXiv:0912.3907},
year = {2016}
}
Comments
Submitted to the IEEE Transactions on Communications, November 2009