A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (Q4701156)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1365088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs |
scientific article; zbMATH DE number 1365088 |
Statements
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (English)
0 references
21 November 1999
0 references
Huffman code
0 references
optimal code
0 references
prefix-free codes of minimum cost
0 references
dynamic programming
0 references
0.9990602135658264
0 references
0.929709255695343
0 references
0.9144197702407836
0 references
