Information Theory, Inference, and Learning Algorithms¶
MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Compression
- Compression is the encoding of information in a representation shorter than the original, exploiting redundancy (statistical regularity, structural predictability, perceptual unimportance)
This sourceIntegrates information theory with inference and machine learning; covers source coding, redundancy, arithmetic coding, and lossy coding. SUPPORTS marker 166 (redundancy = statistical regularity / structural predictability / perceptual unimportance). PARTIALLY supports marker 179 (T5: 'audio from predictive coding') — MacKay is a general info-theory text and does not specifically treat audio predictive coding; the source/predictive-coding material is generic. Link is the author's official free-book page. See flag on 179.
- Compression is the encoding of information in a representation shorter than the original, exploiting redundancy (statistical regularity, structural predictability, perceptual unimportance)
Domain-specific¶
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 3 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:6279d4607260 · see in the full table