Tight bounds on the redundancy of Huffman codes (Q3991400)

From MaRDI portal
Revision as of 15:12, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tight bounds on the redundancy of Huffman codes
scientific article

    Statements

    Tight bounds on the redundancy of Huffman codes (English)
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    upper bounds
    0 references
    redundancy
    0 references
    binary Huffman codes
    0 references
    lower bound
    0 references
    \(D\)-ary Huffman codes
    0 references