--- title: Linear programming decoding slug: linear-programming-decoding qid: snapshot: enwiki-001094319051 content_hash: license: CC BY-SA 4.0 source: https://en.wikipedia.org/w/index.php?oldid=1094319051 tags: [20476732, 23468805, 23603337, 26220375, 26709293] --- # Linear programming decoding > [!note] Provenance > Snapshot `enwiki-001094319051` · content root `…` > Derived from · Licensed CC BY-SA 4.0 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. 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. 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. 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.