Jump to content

Linear programming decoding

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Richhoncho (talk | contribs) at 20:04, 27 December 2008 (+cats). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

^ "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.

This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles. (November 2008)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Linear_programming_decoding&oldid=260367781"

Hidden categories: