Referenced Items are not available for this document.
All binary prefix codes, including Huffman codes, are "complete", in the sense that the vertices in their decoding trees are either leaves or have two children. An open question has been to characterize which prefix codes and which complete prefix codes have a self-synchronizing string. Various algorithms have been proposed for determining the self-synchronizing string. In this paper, we prove that almost all complete prefix codes have a self-synchronizing string.
Published in:
Information Theory, 2003. Proceedings. IEEE International Symposium on
Date of Conference: 29 June-4 July 2003
- Print ISBN:
- 0-7803-7728-1
- INSPEC Accession Number:
- 8357804
- Digital Object Identifier :
- 10.1109/ISIT.2003.1228063
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
