A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs (Q4645183)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs |
scientific article; zbMATH DE number 6999437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs |
scientific article; zbMATH DE number 6999437 |
Statements
A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs (English)
0 references
10 January 2019
0 references
minimum cost
0 references
internal node
0 references
dynamic programming algorithm
0 references
level truncation
0 references
deep node
0 references
0.9990602135658264
0 references
0.9271146655082704
0 references
0.9140365719795228
0 references
0.9116458892822266
0 references
