Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (Q4538082)

From MaRDI portal
Revision as of 10:13, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references