The Theory of Error-Correcting Codes¶
MacWilliams, F. J., & Sloane, N. J. A. (1977). The Theory of Error-Correcting Codes.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Linear Independence
- In coding theory redundancy is deliberately added linear dependence that lets a receiver detect and correct errors, with the code's dimension being the count of independent symbols.
This sourceLinear codes as deliberately added linear dependence (parity symbols), with code dimension the count of independent symbols.
- In coding theory redundancy is deliberately added linear dependence that lets a receiver detect and correct errors, with the code's dimension being the count of independent symbols.
Domain-specific¶
- Ring
- . Coding theory — cyclic codes are ideals in quotient polynomial rings, and the whole theory of BCH and Reed–Solomon codes lives in ring theory
This sourceCyclic codes as ideals in the ring of polynomials modulo x^n - 1, with BCH and Reed-Solomon codes treated in that framework (Chs. 7-10).
Supported in partVerified against the source
- . Coding theory — cyclic codes are ideals in quotient polynomial rings, and the whole theory of BCH and Reed–Solomon codes lives in ring theory
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? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
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:13196d383df5 · see in the full table