Linear programming decoding: Difference between revisions
Appearance
Content deleted Content added
Marcocapelle (talk | contribs) removed grandparent category of Category:Linear programming |
#suggestededit-add 1.0 Tags: Mobile edit Mobile app edit Android app edit |
||
Line 1: | Line 1: | ||
{{Short description|Decoding method}} |
|||
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–972, March 2005.</ref> They showed how the LP can be used to decodes block codes. |
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–972, March 2005.</ref> They showed how the LP can be used to decodes block codes. |
||
Revision as of 00:30, 22 February 2022
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.