Professional Documents
Culture Documents
Ziv Lempel 1977 Universal Algorithm
Ziv Lempel 1977 Universal Algorithm
3, MAY 1977
337
Manuscript received June 23, 1975; revised July 6, 1976. Paper previously presented at the IEEE International Symposium on Information
Theory, Ronneby, Sweden, June 21-24, 1976.
J. Ziv was with the Department of Electrical Engineering, TechnionIsrael Institute of Technology, Haifa, Israel. He is now with the Bell
Telephone Laboratories, Murray Hill, NJ 07974.
A. Lempel was with the Department of Electrical Engineering, TechnionIsrael Institute of Technology, Haifa, Israel. He is now with the
Sperry Research Center, Sudbury, MA 01776.
343
REFERENCES
[1] D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, 1952.
[2] R. M. Karp, "Minimum-redundancy coding for the discrete noiseless
channel," IRE Trans. Inform. Theory, vol. IT-17, pp. 27-38, Jan.
1961.
[3] B. F. Varn, "Optimal variable length codes," Inform. Contr., vol.
19, pp. 289-301, 1971.
[4] Y. Perl, M. R. Gary, and S. Even, "Efficient generation of optimal
prefix code: Equiprobable words using unequal cost letters," J.
ACM, vol. 22, pp. 202-214, April 1975.
[5] A. Lempel, S. Even, and M. Cohn, "An algorithm for optimal prefix
parsing of a noiseless and memoryless channel," IEEE Trans. Inform. Theory, vol. IT-19, pp. 208-214, March 1973.
[6] F. Jelinek and K. S. Schneider, "On variable length to block coding,"
IEEE Trans. Inform. Theory, vol. IT-18, pp. 765-774, Nov. 1972.
[7] R. G. Gallager, Information Theory and Reliable Communication.
New York: Wiley, 1968.
[8] J. Ziv, "Coding of sources with unknown statisticsPart I; Probability of encoding error," IEEE Trans. Inform. Theory, vol. IT-18,
pp. 384-394, May 1972.
[9] L. D. Davisson, "Universal noiseless coding," IEEE Trans. Inform.
Theory, vol. IT-19, pp. 783-795, Nov. 1973.
[10] A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE
Trans. Inform. Theory, vol. IT-22, pp. 75-81, Jan. 1976.
[11] B. M. Fitingof, "Optimal coding in the case of unknown and
changing message statistics," Prob. Inform. Transm., vol. 2, pp.
3-11, 1966.