Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
prefix codes
uniquely decodable codes |
| gptkbp:field |
gptkb:information_theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kraft-McMillan inequality
|
| gptkbp:namedAfter |
gptkb:Leonard_M._Kraft
Brockway McMillan |
| gptkbp:publishedIn |
1949
|
| gptkbp:relatedTo |
gptkb:Huffman_coding
gptkb:organization gptkb:Shannon's_source_coding_theorem |
| gptkbp:state |
For any prefix code over a D-ary alphabet, the sum of D^{-l_i} over all codeword lengths l_i is less than or equal to 1.
|
| gptkbp:usedIn |
coding theory
data compression |
| gptkbp:bfsParent |
gptkb:Source_coding_theorem
|
| gptkbp:bfsLayer |
6
|