Optimal binary prefix-condition codes with ordinal probabilities

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 com...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of the American Society for Information Science Ročník 41; číslo 5; s. 330 - 333
Hlavný autor: Greenberg, Irwin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Washington, D.C Wiley Subscription Services, Inc., A Wiley Company 01.07.1990
John Wiley & Sons
American Documentation Institute
Wiley Periodicals Inc
Predmet:
ISSN:0002-8231, 1097-4571
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ark:/67375/WNG-272RMD4C-3
istex:2DCB9C1272B18D974AE0959C13290BCF509E104E
ArticleID:ASI3
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0002-8231
1097-4571
DOI:10.1002/(SICI)1097-4571(199007)41:5<330::AID-ASI3>3.0.CO;2-H