Self-Synchronizing Huffman Codes

IEEE Transactions on Information Theory

Volumn 30, Issue 4, 1984, Pages 687-693

  Rabinowitz, Joshua H ^b  

^a Analytic Sciences Corporation   (United States)

^b Gould Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0021465990     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056931     Document Type: Article

References (9)

1. J. J. Stiffler, Theory of Synchronous Communications. Englewood Cliffs, NJ: Prentice-Hall, 1971.
2. E. N. Gilbert and E. F. Moore, “Variable length binary encodings,” Bell Syst. Tech. J., vol. 38, p. 933, 1959.
3. P. G. Neumann “Efficient error-limiting variable length codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 292–304, July 1962.
4. V. K. W. Wei and R. A. Scholtz “On the Characterization of Statistically Synchronizable Codes,” IEEE Trans. Inform. Theory, vol. IT-26, no. 6, pp. 733–735, Nov. 1980.
5. D. A. Huffman “A method for the construction of minimum redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, 1952.
6. G. Longo and G. Galasso “An application of informational divergence to Huffman codes,” IEEE Trans. Inform. Theory, vol. IT-28, no. 1, pp. 36–43, Jan. 1982.
7. O. Johnsen “On the redundancy of binary Huffman codes,” IEEE Trans. Inform. Theory, vol. IT-26, no. 2, pp. 220–222, Mar. 1980.
8. W. F. Friedman, Elements of Cryptanalysis. Laguna Hills, CA: Aegean Park, 1976.
9. F. Pratt, Secret and Urgent. Garden City, NY: Blue Ribbon Books, 1942.