Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Shannon's_source_coding_theorem
|
| gptkbp:appliesTo |
discrete memoryless sources
|
| gptkbp:describes |
limits of lossless data compression
|
| gptkbp:field |
gptkb:information_theory
|
| gptkbp:formedBy |
gptkb:Claude_Shannon
1948 |
| https://www.w3.org/2000/01/rdf-schema#label |
Data compression theorem
|
| gptkbp:implies |
no lossless compression scheme can have average codeword length less than entropy
|
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedTo |
gptkb:Huffman_coding
gptkb:Shannon_entropy gptkb:rate-distortion_theory source coding arithmetic coding |
| gptkbp:state |
the entropy of a source is the lower bound for average codeword length in lossless compression
|
| gptkbp:bfsParent |
gptkb:Information_Theory
|
| gptkbp:bfsLayer |
5
|