Optimum '1'-ended binary prefix codes

The problem of finding a binary prefix code of minimum average codeword length for a given finite probability distribution subject to the requirement that each codeword must end with a 1 is considered. Lower and upper bounds to the performance of the optimum code are derived; the lower bound is tigh...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 36; no. 6; pp. 1435 - 1441
Main Authors Berger, T., Yeung, R.W.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.11.1990
Institute of Electrical and Electronics Engineers
Subjects
Algorithm design and analysis
Applied sciences
Engines
Exact sciences and technology
Fault diagnosis
Hydrocarbon reservoirs
Information, signal and communications theory
Lubricating oils
Petroleum
Probability distribution
Production facilities
Telecommunications and information theory
Testing
Upper bound
Optimum
Lower bound
Prefix code
Upper bound
Probability law
Performance
Algorithm
Binary code
Online AccessGet full text
ISSN0018-9448
DOI10.1109/18.59940

Cover

More Information
Summary:The problem of finding a binary prefix code of minimum average codeword length for a given finite probability distribution subject to the requirement that each codeword must end with a 1 is considered. Lower and upper bounds to the performance of the optimum code are derived; the lower bound is tight for certain probability distributions. An algorithm that generates an optimum code for any given distribution is described.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
DOI:10.1109/18.59940