Statements (13)
| 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's inequality
|
| gptkbp:namedAfter |
gptkb:Leonard_M._Kraft
|
| gptkbp:publicationYear |
1949
|
| gptkbp:publishedIn |
gptkb:Quarterly_Journal_of_Mathematics
|
| gptkbp:state |
For any prefix code over an alphabet of size r, the sum of r^{-l_i} over all codeword lengths l_i is less than or equal to 1.
|
| gptkbp:usedFor |
determining existence of prefix codes
|
| gptkbp:usedIn |
coding theory
|
| gptkbp:bfsParent |
gptkb:John_Henry_Kraft
|
| gptkbp:bfsLayer |
7
|