Jump to content

Linear programming decoding

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jitse Niesen (talk | contribs) at 23:08, 20 March 2009 (reinstate categories deleted in edit before last; some formatting). 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 LP decodes block codes with relaxation.

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.


Stub icon

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

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