Optimal binary prefix‐condition codes with ordinal probabilities

Irwin Greenberg

Journal of the American Society for Information Science, 1990, vol. 41, issue 5, 330-333

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.

Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(199007)41:53.0.CO;2-H

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:41:y:1990:i:5:p:330-333

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().