Linear programming decoding: Difference between revisions

Content deleted Content added

Inline

Revision as of 22:41, 6 February 2018

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 decodes 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

^ "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 applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

[feldman-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.

[1]

Revision as of 23:34, 14 September 2013 edit Duoduoduo (talk \| contribs) Extended confirmed users, Pending changes reviewers 11,085 edits spell out acronym once more ← Previous edit		Revision as of 22:41, 6 February 2018 edit undo Marcocapelle (talk \| contribs) Extended confirmed users, Page movers 581,273 edits removed Category:Operations research; added Category:Linear programming using HotCat Next edit →
Line 10:		Line 10:

	[[Category:Mathematical optimization]]		[[Category:Mathematical optimization]]
	[[Category:~~Operations~~ ~~research~~]]		[[Category:Linear programming]]