Title :
Optimum `1´-ended binary prefix codes
Author :
Berger, Toby ; Yeung, Raymond W.
Author_Institution :
Cornell Univ., Ithaca, NY, USA
fDate :
11/1/1990 12:00:00 AM
Abstract :
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
Keywords :
codes; binary prefix code; finite probability distribution; lower bound; minimum average codeword length; optimum code; upper bounds; Algorithm design and analysis; Engines; Fault diagnosis; Hydrocarbon reservoirs; Lubricating oils; Petroleum; Probability distribution; Production facilities; Testing; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
