Edge Rewrite
location Source code View original
// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a21da2383b43cc36

Jump to content

Linear programming decoding

Add links
From Wikipedia, the free encyclopedia

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]
  1. ↑ "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.


Retrieved from "https://en.wikipedia.org/w/index.php?title=Linear_programming_decoding&oldid=1094319051"