Jump to content

Linear programming decoding

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fabrictramp (talk | contribs) at 21:17, 23 November 2008 (New page patrol; You can help! using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In Information 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]

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.