A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (Q4701156)

From MaRDI portal
Revision as of 01:19, 3 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    21 November 1999
    0 references
    0 references
    Huffman code
    0 references
    optimal code
    0 references
    prefix-free codes of minimum cost
    0 references
    dynamic programming
    0 references