A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes (Q4503603)
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 1503420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes |
scientific article; zbMATH DE number 1503420 |
Statements
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes (English)
0 references
7 September 2000
0 references
dynamic programming
0 references
one-ended codes
0 references
Huffman-encoding problem
0 references
minimum cost prefix-free code
0 references
algorithm
0 references
0.92339396
0 references
0.9207647
0 references
0 references
0.90250224
0 references
0.8816117
0 references
0.8728015
0 references
0 references
