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 |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Mordecai J. Golin / rank | |||
| Property / author | |||
| Property / author: Wojciech Rytter / rank | |||
| Property / author | |||
| Property / author: Mordecai J. Golin / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Wojciech Rytter / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033300243 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:02, 19 March 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
