Shannon's source coding theorem
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:noiseless_coding_theorem
|
| gptkbp:appliesTo |
discrete memoryless sources
|
| gptkbp:field |
gptkb:information_theory
|
| gptkbp:form |
L → H(X) as n → ∞
L ≥ H(X) |
| gptkbp:formedBy |
gptkb:Claude_Shannon
1948 |
| https://www.w3.org/2000/01/rdf-schema#label |
Shannon's source coding theorem
|
| gptkbp:implies |
lossless data compression is possible up to the entropy limit
|
| gptkbp:influenced |
coding theory
modern digital communication data compression algorithms |
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedTo |
gptkb:Huffman_coding
gptkb:entropy_(information_theory) data compression source coding |
| gptkbp:state |
the average length of the optimal code is at least the entropy of the source
for a discrete memoryless source, it is possible to compress data to its entropy rate without loss |
| gptkbp:bfsParent |
gptkb:Slepian–Wolf_coding
gptkb:rate-distortion_theory |
| gptkbp:bfsLayer |
5
|