A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (Q4701156): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Mordecai J. Golin / rank | |||
| Property / author | |||
| Property / author: Mordecai J. Golin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148949320 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:07, 20 March 2024
scientific article; zbMATH DE number 1365088
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
