Linear programming decoding

Short description: Decoding method

In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming (LP) theory to solve decoding problems. This approach was first used by Jon Feldman et al.[1] They showed how the LP can be used to decode block codes.

The basic idea behind LP decoding is to first represent the maximum likelihood decoding of a linear code as an integer linear program, and then relax the integrality constraints on the variables into linear inequalities.

## References

1. ↑ "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954-972, March 2005.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Linear programming decoding. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Linear_programming_decoding&oldid=284385"