Linear programming decoding: Difference between revisions
Content deleted Content added
#suggestededit-add 1.0 Tags: Mobile edit Mobile app edit Android app edit |
m grammar |
||
| Line 1: | Line 1: | ||
{{Short description|Decoding method}} |
{{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 |
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 decode block codes. |
||
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. |
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. |
||
Latest revision as of 22:28, 21 June 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 decode 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
[edit]- ^ "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. |