• DocumentCode
    1409911
  • Title

    A note on D-ary Huffman codes

  • Author

    Capocelli, Rcnato M. ; De Santis, Alfredo

  • Author_Institution
    Dipartimento di Matematica, Roma Univ., Italy
  • Volume
    37
  • Issue
    1
  • fYear
    1991
  • fDate
    1/1/1991 12:00:00 AM
  • Firstpage
    174
  • Lastpage
    179
  • Abstract
    An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p1 of the most likely source letter is provided. For large values of p1, the bound improves the one given by R.G. Gallager (1978). Additionally, some results known for the binary case (D=2) are extended to arbitrary D-ary Huffman codes. As a consequence, a tight lower bound that corrects a bound recently proposed by J.D. Golic and M.M. Obradovic (1987) is derived
  • Keywords
    codes; redundancy; D-ary Huffman codes; most likely source letter; probability; redundancy; tight lower bound; upper bound; Binary codes; Councils; Decoding; Entropy; Information theory; Random variables; 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/18.61134
  • Filename
    61134
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1409911