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¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:6f877d927ff4 · see in the full table