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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of the American Society for Information Science Vol. 41; no. 5; pp. 330 - 333
Main Author:	Greenberg, Irwin
Format:	Journal Article
Language:	English
Published:	Washington, D.C Wiley Subscription Services, Inc., A Wiley Company 01.07.1990 John Wiley & Sons American Documentation Institute Wiley Periodicals Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!