Coding Theorems for a Discrete Source with a Fidelity Criterion¶
Shannon, C. E. (1959). Coding Theorems for a Discrete Source with a Fidelity Criterion. IRE National Convention Record.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Compressed Data Format
- The governing idea is that every lossy format lives on a rate–distortion curve — you cannot get both a smaller size and lower distortion past a hard limit
This sourceDefines a rate–distortion limit for lossy coding and makes the tolerated distortion depend on the chosen fidelity criterion.
- The governing idea is that every lossy format lives on a rate–distortion curve — you cannot get both a smaller size and lower distortion past a hard limit
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
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:683ce2a3927f · see in the full table