Fast Linear-Programming decoding of LDPC codes over GF(2m)

@article{Honda2012FastLD,
  title={Fast Linear-Programming decoding of LDPC codes over GF(2m)},
  author={Junya Honda and Hirosuke Yamamoto},
  journal={2012 International Symposium on Information Theory and its Applications},
  year={2012},
  pages={754-758}
}
Recently Linear Programming (LP) decoding is attracting much attention as an alternative to Belief Propagation (BP) decoding for LDPC codes. It is well known for the BP decoding that nonbinary LDPC codes can improve the decoding error probability considerably. On the other hand, Flanagan et al. proposed an LP decoding scheme for LDPC codes over finite rings. Although their scheme is applicable to LDPC codes over finite fields, the number of variables in the LP grows rapidly and hence, its… CONTINUE READING