• DocumentCode
    1304260
  • Title

    Optimum `1´-ended binary prefix codes

  • Author

    Berger, Toby ; Yeung, Raymond W.

  • Author_Institution
    Cornell Univ., Ithaca, NY, USA
  • Volume
    36
  • Issue
    6
  • fYear
    1990
  • fDate
    11/1/1990 12:00:00 AM
  • Firstpage
    1435
  • Lastpage
    1441
  • Abstract
    The problem of finding a binary prefix code of minimum average codeword length for a given finite probability distribution subject to the requirement that each codeword must end with a 1 is considered. Lower and upper bounds to the performance of the optimum code are derived; the lower bound is tight for certain probability distributions. An algorithm that generates an optimum code for any given distribution is described
  • Keywords
    codes; binary prefix code; finite probability distribution; lower bound; minimum average codeword length; optimum code; upper bounds; Algorithm design and analysis; Engines; Fault diagnosis; Hydrocarbon reservoirs; Lubricating oils; Petroleum; Probability distribution; Production facilities; Testing; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.59940
  • Filename
    59940
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1304260