Interval and Recency Rank Source Coding: Two Online Adaptive Variable-Length Schemes

IEEE Transactions on Information Theory

Volumn 33, Issue 1, 1987, Pages 3-10

  Elias, Peter ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY;

INTERVAL ENCODING; ON-LINE CODING; RECENCY RANK ENCODING; WEAK-LAW SOURCES;

CODES, SYMBOLIC;

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

References (25)

1. J. L. Bentley, D. Sleator, R. E. Tarjan and V. K. Wei, “A locally adaptive data compression scheme,” in Proceedings of the Twenty Second Allerton Conference on Communication, Control and Computing, Oct. 1984, pp. 233-242.
2. J. L. Bentley and A. C. Yao, “An almost optimal algorithm foi unbounded searching,” Inf. Processing Lett., vol. 5, no. 3, pp 82-87, Aug. 1976.
3. L. D. Davisson and A. Leon-Garcia, “A source matching approach: to finding minimax codes,” IEEE Trans. Inform. Theory, vol IT-26, no. 2, pp. 166-174, March 1980.
4. P. Elias, “Minimum times and memories needed to compute the values of a function,” J. Comput. Syst. Sci., vol. 9, no. 2, pp 196-212, Oct. 1974.
5. “Universal codeword sets and representations of the integers,' IEEE Trans. Inform. Theory, vol. IT-21, no. 2, pp. 194-203, March 1975.
6. “Minimax optimal universal codeword sets,” IEEE Trans. Inform. Theory, vol. IT-29, no. 4, pp. 491-502, July 1983.
7. S. Even and M. Rodeh, “Economical encoding of commas between strings,” Comm. Assoc. for Comp. Mach., vol. 21, no. 4, pp. 315-317, April 1978.
8. N. Faller, “An adaptive system for data compression,” in Conference Record, Asilomar Conference on Circuits, Systems and Computers, 7th conference, 1973, pp. 593-597.
9. R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, Nov. 1978.
10. M. E. Gonzalez Smith and J. A. Storer, “Parallel algorithms for data compression,” J. Assoc. Comput. Mach., vol. 32, pp. 344-373, Apr. 1985.
11. D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA: Addison-Wesley, 1973, pp. 398-399 and exercises 11, 12, p. 403.
12. “Dynamic Huffman coding,” J. Algorithms, vol. 6, pp. 163-180, June 1985.
13. A. Lempel and J. Ziv, “On the complexity of finite sequences,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 75-81, Jan. 1976.
14. V. I. Levenstein, “The redundancy and decceleration of a separative encoding of the natural numbers,” Probl. Cybern., no. 20, pp. 173-179, 1968.
15. V. S. Miller and M. N. Wegman, “Variations on a theme by Lempel and Ziv,” to be published in Combinatorial Algorithms on Words, Lecture Notes in Computer Science, Apostolico and Galil, Eds. Berlin: Springer.
16. J. Rissanen, “Minimax codes for finite alphabets,” IEEE Trans. Inform. Theory, vol. IT-24, no. 3, pp. 389-392, May 1978.
17. R. Rivest, “On self-organizing search heuristics,” Comm. Assoc. Comp. Mach., vol. 19, no. 2, pp. 63-67, Feb. 1976.
18. M. Rodeh, V. Pratt and S. Even, “Linear algorithm for data compression via string matching,” J. Assoc. for Comp. Mach., vol. 28, no. 1, pp. 16-24, Jan. 1981.
19. D. D. Sleator and R. E. Taijan, “Amortized efficiency of list update and paging rules,” Comm. Assoc. for Comp. Mach., vol. 28, no. 2, Feb. 1985.
20. J. S. Vitter, “Design and analysis of dynamic Huffman coding,” in Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 293-302, IEEE Computer Society Press, October 1985.
21. T. A. Welch, “A technique for high-performance data compression,” IEEE Comput. vol. 17, pp. 8-19, June 1984.
22. A. D. Wyner, “An upper bound on the entropy series,” Inform. Contr., vol. 20, pp. 176-181, 1972.
23. J. Ziv and A. Lempel, “A universal algorithm for data compression,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, May 1977.
24. J. Ziv, “Coding theorems for individual sequences,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 405-412, July 1978.
25. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.