IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v41y1990i5p330-333.html
   My bibliography  Save this article

Optimal binary prefix‐condition codes with ordinal probabilities

Author

Listed:
  • Irwin Greenberg

Abstract

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix‐condition code. The estimates maximize the entropy subject to constraints specifying second‐level orderings of the letters' likelihoods. These are compared to estimates obtained from another probability estimation technique described in the decision theory literature using the English alphabet as an example. © 1990 John Wiley & Sons, Inc.

Suggested Citation

  • Irwin Greenberg, 1990. "Optimal binary prefix‐condition codes with ordinal probabilities," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 41(5), pages 330-333, July.
    • Handle: RePEc:bla:jamest:v:41:y:1990:i:5:p:330-333
    DOI: 10.1002/(SICI)1097-4571(199007)41:53.0.CO;2-H
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(199007)41:53.0.CO;2-H
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1097-4571(199007)41:53.0.CO;2-H?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:41:y:1990:i:5:p:330-333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.