Jump to content

Linear programming decoding

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 137.43.155.108 (talk) at 17:08, 10 June 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from 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 decodes block codes.

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.