Linear programming decoding: Difference between revisions
Content deleted Content added
Marcocapelle (talk | contribs) removed Category:Operations research; added Category:Linear programming using HotCat |
Marcocapelle (talk | contribs) removed grandparent category of Category:Linear programming |
||
| Line 9: | Line 9: | ||
{{mathapplied-stub}} |
{{mathapplied-stub}} |
||
[[Category:Mathematical optimization]] |
|||
[[Category:Linear programming]] |
[[Category:Linear programming]] |
||
Revision as of 21:18, 8 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. |