Kraft's inequality (Q6481805): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Dictionary of Algorithms and Data Structures ID | |||
| Property / Dictionary of Algorithms and Data Structures ID: kraftsinqlty / rank | |||
Normal rank | |||
Latest revision as of 23:18, 17 February 2025
necessary and sufficient condition for the existence of a prefix code for a given set of codeword lengths
- Kraft–McMillan inequality
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kraft's inequality |
necessary and sufficient condition for the existence of a prefix code for a given set of codeword lengths |
|
Statements
Identifiers
205612216
0 references
computer-science/kraft-inequality
0 references
engineering/kraft-inequality
0 references
mathematics/kraft-inequality
0 references
