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ženo v:

Podrobná bibliografie
Vydáno 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:	angličtina
Vydáno:	Washington, D.C Wiley Subscription Services, Inc., A Wiley Company 01.07.1990 John Wiley & Sons American Documentation Institute Wiley Periodicals Inc
Témata:	Algorithms Alphabet letters Applied sciences Binary codes Binary coding Codes Coding Decision analysis Decision theory English language Entropy Estimates Exact sciences and technology Expected values Information storage and retrieval Information theory Information work Information, signal and communications theory Letters (Correspondence) Linear programming Maximum entropy method Operations research Prefixes Probability Rule ordering Subject indexing Technical services Telecommunications and information theory Tennis Alphabet Letter English Huffman code Estimation Probability Ordering Method of maximum entropy Algorithm Information theory
ISSN:	0002-8231, 1097-4571
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!