Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Shannon's_source_coding_theorem
|
| gptkbp:appliesTo |
discrete memoryless sources
|
| gptkbp:category |
gptkb:information_theory
gptkb:mathematical_concept |
| gptkbp:field |
gptkb:information_theory
|
| gptkbp:form |
L → H(X) as n → ∞
L ≥ H(X) |
| gptkbp:formedBy |
gptkb:Claude_Shannon
|
| https://www.w3.org/2000/01/rdf-schema#label |
Noiseless coding theorem
|
| gptkbp:implies |
lossless data compression
|
| gptkbp:influenced |
modern data compression algorithms
|
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedTo |
gptkb:Huffman_coding
gptkb:Shannon_entropy gptkb:Kraft-McMillan_inequality channel coding theorem source coding |
| gptkbp:state |
The average length of the optimal code is at least the entropy of the source
It is possible to compress data to its entropy without loss |
| gptkbp:yearProposed |
1948
|
| gptkbp:bfsParent |
gptkb:Source_coding_theorem
|
| gptkbp:bfsLayer |
6
|