Efficient Linear Programming Decoding of HDPC Codes

Details Efficient Linear Programming Decoding of HDPC Codes Efficient Linear Programming Decoding of HDPC Codes

2009-12-19

arxiv.org/abs/0912.3907v1

Computer Science

Information Theory

Submitted to the IEEE Transactions on Communications, November 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient Linear Programming Decoding of HDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Linear Programming Decoding of HDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Linear Programming Decoding of HDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-382025