Abstract
We have investigated the problem of finding a binary prefix code of minimum average code word length for a given finite probability distribution subject to the requirement that each code word must end with a ’1’. We give lower and upper bounds to the performance of the optimum code for any information source; the lower bound is tight in some cases. We also describe an algorithm that generates an optimum code for any information source.
on leave from Department of Electrical Engineering Cornell University Ithaca, NY 14853, U.S.A.
This work was supported in part by National Science Foundation under Grants ECS-8204886 and ECS 8521218 and in part by Centre National de la Recherche Scientifique, Paris, France.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, T., Yeung, R. (1988). Optimum ’1’ — Ended binary prefix codes. In: Cohen, G., Godlewski, P. (eds) Coding Theory and Applications. Coding Theory 1986. Lecture Notes in Computer Science, vol 311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19368-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-19368-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19368-5
Online ISBN: 978-3-540-39243-9
eBook Packages: Springer Book Archive