Using linear programming to Decode Binary linear codes¶
Using linear programming to Decode Binary linear codes.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Linear programming decoding
- Binary code constraints are represented through parity-check local polytopes, the channel log-likelihood defines a linear objective and fractional pseudocodewords expose when the relaxation differs from exact maximum likelihood.
This sourceWainwright and D.R. Karger, IEEE Transactions on Information Theory, 51:954–972, March 2005.
- Binary code constraints are represented through parity-check local polytopes, the channel log-likelihood defines a linear objective and fractional pseudocodewords expose when the relaxation differs from exact maximum likelihood.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:6f877d927ff4 · see in the full table