Good Error-Correcting Codes Based on Very Sparse Matrices¶
MacKay, D. J. C. (1999). Good Error-Correcting Codes Based on Very Sparse Matrices. IEEE Transactions on Information Theory, 45(2), 399-431.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Low-Density Parity-Check Code
- MacKay's original investigation distinguishes this code construction from both the optimal decoding problem and particular practical decoders.
This sourceOriginal paper directly inspected; code construction, parity-check equivalence, regular graph, decoding comparison and conditional performance claims are in the cited portions.
- MacKay's original investigation distinguishes this code construction from both the optimal decoding problem and particular practical decoders.
- Sparse Graph Code
- Both encode recoverable information through sparse incidence, but their graph semantics and channel models differ.
This sourceOptimal-decoder existence and practical-decoder experiments are distinct claims.
- Both encode recoverable information through sparse incidence, but their graph semantics and channel models differ.
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. Neither this nor any other of the 2 citations of this work carries a 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:6a3aa941c162 · see in the full table