Almost all Complete Binary Prefix Codes have a Self-synchronizing String

IEEE Transactions on Information Theory

Volumn 49, Issue 9, 2003, Pages 2219-2225+2321

  Freiling, Christopher F ^a   Jungreis, Douglas S ^b   Théberge, François ^c   Zeger, Kenneth ^d  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^c DEPARTMENT OF NATIONAL DEFENCE   (Canada)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Channel noise; Source coding; Synchronization; Variable length codes

Indexed keywords

BINARY CODES; PROBABILITY; SIGNAL RECEIVERS; SPURIOUS SIGNAL NOISE; SYNCHRONIZATION;

BINARY PREFIX CODES;

COMMUNICATION SYSTEMS;

EID: 0043282841     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.815803     Document Type: Article

References (30)

1. J. Berstel and D. Perrin, Theory of Codes. New York: Academic, 1985.
2. R. M. Capocelli, L. Gargano, and U. Vaccaro, "On the characterization of statistically synchronizable variable-length codes," IEEE Trans. Inform. Theory, vol. 34, pp. 817-825, July 1988.
3. R. M. Capocelli, A. A. De Santis, L. Gargano, and U. Vaccaro, "On the construction of statistically synchronizable codes," IEEE Trans. Inform. Theory, vol. 38, pp. 407-414, Mar. 1992.
4. T. M. Cover and J. A. Thomas, Introduction to Information Theory. New York: Wiley, 1991.
5. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
6. A. E. Escott and S. Perkins, "Binary Huffman equivalent codes with a short synchronizing codeword," IEEE Trans. Inform. Theory, vol. 44, pp. 346-351, Jan. 1998.
7. S. Even, "Test for synchronizability of finite automata and variable length codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 185-189, July 1964.
8. T. J. Ferguson and J. H. Rabinowitz, "Self-synchronizing Huffman codes," IEEE Trans. Inform. Theory, vol. IT-30, pp. 687-693, July 1984.
9. R. Gallager, Information Theory and Reliable Communication. Englewood Cliffs, NJ: Prentice-Hall, 1968.
10. E. N. Gilbert, "Synchronization of binary messages," Proc. IRE, vol. 48, pp. 470-477, Sept. 1960.
11. E. N. Gilbert and E. F. Moore, "Variable-length binary encodings," Bell Syst. Tech. J., vol. 38, pp. 933-967, July 1959.
12. S. W. Golomb and B. Gordon, "Codes with bounded synchronization delay," Inform. Contr., vol. 8, pp. 355-372, 1965.
13. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, Sept. 1952.
14. D. E. Knuth, The Art of Computer Programming. Reading, MA: Addison-Wesley, 1973, vol. 3.
15. W.-M. Lam and R. Kulkarni, "Extended synchronizing codewords for binary prefix codes," IEEE Trans. Inform. Theory, vol. 42, pp. 984-987, May 1996.
16. V. I. Levenshtein, "Certain properties of code systems," Soviet Phys.-Dokl., vol. 6, no. 6, pp. 858-860, 1962.
17. J. C. Maxted and J. P. Robinson, "Error recovery for variable length codes," IEEE Trans. Inform. Theory, vol. IT-31, pp. 794-801, Nov. 1985.
18. R. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
19. M. E. Monaco and J. M. Lawler, "Corrections and additions to "error recovery for variable-length codes"," IEEE Trans. Inform. Theory, vol. IT-33, pp. 454-456, May 1987.
20. B. L. Montgomery and J. Abrahams, "Synchronization of binary source codes," IEEE Trans. Inform. Theory, vol. IT-32, pp. 849-854, Nov. 1986.
21. H. Morita, A. J. van Wijngaarden, and A. J. Han Vinck, "On the construction of maximal prefix-synchronized codes," IEEE Trans. Inform. Theory, vol. 42, pp. 2158-2166, Nov. 1996.
22. P. G. Neumann, "Efficient error-limiting variable length codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 292-304, July 1962.
23. M. Rahman and S. Misbahuddin, "Effects of a binary symmetric channel on the synchronization recovery of variable length codes," Comput. J., vol. 32, pp. 246-251, 1989.
24. K. H. Rosen, Ed., Handbook of Discrete and Combinatorial Mathematics, Boca Raton, FL: CRC, 2000.
25. B. Rudner, "Construction of minimum-redundancy codes with an optimum synchronization property," IEEE Trans. Information Theory, vol. IT-17, pp. 478-487, July 1971.
26. P. F. Swaszek and P. DiCicco, "More on the error recovery for variable-length codes," IEEE Trans. Inform. Theory, vol. 41, pp. 2064-2071, Nov. 1995.
27. Y. Takishima, M. Wada, and H. Murakami, "Error states and synchronization recovery for variable length codes," IEEE Trans. Commun., vol. 42, pp. 783-792, Feb. 1994.
28. M. R. Titchener, "The synchronizaation of variable-length codes," IEEE Trans. Inform. Theory, vol. 43, pp. 683-691, Mar. 1997.
29. V. K. W. Wei and R. A. Scholtz, "On the characterization of statistically synchronizable codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 733-735, Nov. 1980.
30. G. Zhou and Z. Zhang, "Synchronization receovery of variable-length codes," IEEE Trans. Inform. Theory, vol. 48, pp. 219-227, Jan. 2002.