http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Linear_programming_decodingLinear programming decoding - Revision history2026-10-26T11:46:59ZRevision history for this page on the wikiMediaWiki 1.43.1http://debianws.lexgopc.com/wiki143/index.php?title=Linear_programming_decoding&diff=7569532&oldid=previmported>Erayatay: grammar2022-06-21T22:28:23Z<p>grammar</p>
<p><b>New page</b></p><div>{{Short description|Decoding method}}<br />
In [[information theory]] and [[coding theory]], '''linear programming decoding (LP decoding)''' is a [[Decoding methods|decoding]] method which uses concepts from [[linear programming]] (LP) theory to solve decoding problems. This approach was first used by Jon Feldman ''et al.''<ref name = feldman> "Using linear programming to Decode Binary linear codes," J. Feldman, M.J. Wainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954&ndash;972, March 2005.</ref> They showed how the LP can be used to decode block codes.<br />
<br />
The basic idea behind LP decoding is to first represent the [[Maximum_likelihood_decoding#Maximum_likelihood_decoding|maximum likelihood decoding]] of a [[linear code]] as an [[Integer_linear_programming|integer linear program]], and then [[Linear_programming_relaxation|relax]] the integrality constraints on the variables into linear inequalities.<br />
<br />
== References ==<br />
<references/><br />
<br />
<br />
{{mathapplied-stub}}<br />
<br />
[[Category:Linear programming]]</div>imported>Erayatay