On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes

Details On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes

2011-05-13

arxiv.org/abs/1105.2631v2

Computer Science

Information Theory

Scientific paper

In this paper we explore the decision regions of Linear Programming (LP) decoding. We compare the decision regions of an LP decoder, a Belief Propagation (BP) decoder and the optimal Maximum Likelihood (ML) decoder. We study the effect of minimal-weight pseudocodewords on LP decoding. We present global optimization as a method for finding the minimal pseudoweight of a given code as well as the number of minimal-weight generators. We present a complete pseudoweight distribution for the [24; 12; 8] extended Golay code, and provide justifications of why the pseudoweight distribution alone cannot be used for obtaining a tight upper bound on the error probability.

Affiliated with

Also associated with

No associations

Rating

On Pseudocodewords and Decision Regions of 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 On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26864