Efficient linear programming decoding of HDPC codes

  • Yufit A
  • Lifshitz A
  • Be'Ery Y
  • 5


    Mendeley users who have this article in their library.
  • 6


    Citations of this article.


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.

Author-supplied keywords

  • Adaptive LP decoding
  • BCH codes
  • LP relaxation
  • automorphism groups
  • belief propagation
  • branch and bound
  • linear programming
  • pseudocodewords

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Alex Yufit

  • Asi Lifshitz

  • Yair Be'Ery

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free