Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Theorem
|
| gptkbp:alsoKnownAs |
gptkb:Shannon's_source_coding_theorem
|
| gptkbp:appliesTo |
gptkb:Discrete_memoryless_sources
|
| gptkbp:describes |
Limits of lossless data compression
|
| gptkbp:field |
Information theory
|
| gptkbp:formedBy |
gptkb:Claude_Shannon
1948 |
| https://www.w3.org/2000/01/rdf-schema#label |
Source coding theorem
|
| gptkbp:implies |
No lossless compression scheme can compress below the source entropy
|
| gptkbp:influenced |
Coding theory
Modern digital communication |
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedTo |
gptkb:Huffman_coding
gptkb:Shannon_entropy gptkb:Arithmetic_coding gptkb:Kraft-McMillan_inequality gptkb:Noiseless_coding_theorem Data compression |
| gptkbp:state |
The average codeword length per symbol cannot be less than the entropy of the source
|
| gptkbp:bfsParent |
gptkb:Information_Theory
|
| gptkbp:bfsLayer |
5
|