• DocumentCode
    943465
  • Title

    A lower bound on the redundancy of D -ary Huffman codes (Corresp.)

  • Author

    Golic, Jovan Dj ; Obradovic, Milorad M.

  • Volume
    33
  • Issue
    6
  • fYear
    1987
  • fDate
    11/1/1987 12:00:00 AM
  • Firstpage
    910
  • Lastpage
    911
  • Abstract
    A necessary and sufficient condition for the most likely letter of any discrete source to be coded by a single symbol with a D -ary Huffman code, 2 \\leq D < \\infty , is derived. As a consequence, a lower bound on the redundancy of a D -ary Huffman code is established.
  • Keywords
    Huffman coding; Entropy; Huffman coding; Source coding; Sufficient conditions; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1987.1057361
  • Filename
    1057361
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=943465