Shannon source coding theorem
GPTKB entity
Statements (21)
| 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)
L < H(X) + 1 |
| gptkbp:formedBy |
gptkb:Claude_Shannon
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shannon source coding theorem
|
| gptkbp:implies |
existence of prefix codes with average length close to entropy
|
| gptkbp:influenced |
coding theory
modern digital communication |
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedTo |
gptkb:Huffman_coding
gptkb:Shannon_entropy data compression source coding |
| gptkbp:state |
the average length of the optimal code is at least the entropy of the source
no lossless data compression scheme can compress all messages below the entropy rate |
| gptkbp:yearProposed |
1948
|
| gptkbp:bfsParent |
gptkb:quantum_source_coding_theorem
|
| gptkbp:bfsLayer |
6
|