• DocumentCode
    2994723
  • Title

    Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 1

  • Author

    Zaharia, Gheorghe ; Munteanu, Valeriu ; Tarniceriu, Daniela

  • Author_Institution
    IETR, Rennes, France
  • fYear
    2009
  • fDate
    9-10 July 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundancy.
  • Keywords
    Huffman codes; D-ary Huffman codes; D-ary Huffman tree; codeword lengths; tight bounds; Data compression; Encoding; Huffman coding; Information technology; Probability distribution; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Circuits and Systems, 2009. ISSCS 2009. International Symposium on
  • Conference_Location
    Iasi
  • Print_ISBN
    978-1-4244-3785-6
  • Electronic_ISBN
    978-1-4244-3786-3
  • Type

    conf

  • DOI
    10.1109/ISSCS.2009.5206161
  • Filename
    5206161
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2994723