Efficient Erasure Correcting Codes¶
Luby, M., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001). Efficient Erasure Correcting Codes. IEEE Transactions on Information Theory, 569-584.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Sparse Graph Code
- Both encode recoverable information through sparse incidence, but their graph semantics and channel models differ.
This sourceThe check-bit XOR graph is not an LDPC parity-check graph.
- 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. 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:60ffc5e293db · see in the full table