A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition. Then, to solve the resulting LP problem, we propose an efficient iterative algorithm based on the alternating direction method of multipliers (ADMM) technique. In addition, the feasibility analysis of the proposed algorithm is presented. Furthermore, througharXiv:1901.07806v1 fatcat:rgosnumvpnhlnh3wytsb2phjmi