Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (Q4538082): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:13, 7 February 2024
scientific article; zbMATH DE number 1766678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property |
scientific article; zbMATH DE number 1766678 |
Statements
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (English)
0 references
11 July 2002
0 references
dynamic programming
0 references
lopsided trees
0 references
Monge matrix
0 references
monotone matrix
0 references
Huffman codes
0 references
optimal prefix-free codes
0 references
