Approximation algorithms for grammar-based compression

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 205-212

  Lehman, Eric ^a   Shelat, Abhi ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CONTEXT FREE GRAMMARS; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; ASYMPTOTICALLY OPTIMAL; COMPRESSION ALGORITHMS; DATA COMPRESSION ALGORITHMS; GRAMMAR-BASED COMPRESSION; POLYNOMIAL-TIME; STATIONARY ERGODIC SOURCES; UPPER AND LOWER BOUNDS;

DATA COMPRESSION;

EID: 84968903114     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Apostolico and S. Lonardi. Some Theory and Practice of Greedy Off-Line Textual Substitution. DCC 1998, pp 119-128.
2. P. Berman and M. Karpinski. On Some Tighter Inap-proximability Results, Further Improvements. ECCC 1998.
3. D. Bleichenbacher. Efficiency and Security of Cryptosystems Based on Number Theory. PhD thesis, Swiss Federal Institute of Technology, 1996.
4. C. de Marcken. The Unsupervised Acquisition of a Lexicon from Continuous Speech. MIT AI Memo 1558. November 1995.
5. P. Downey, B. Leong, and R. Sethi. Computing Sequences with Addition Chains. SIAM Journal on Computing, 10(3) :638-646, August 1981.
6. J. C. Kieffer and E. Yang. Grammar-Based Codes: a New Class of Universal Lossless Source Codes. IEEE Transactions on Information Theory, Vol. 46 (2000), pp. 737-754.
7. J. C. Kieffer, E. Yang, G. J. Nelson, P. Cosman. Universal Lossless Compression via Multilevel Pattern Matching. IEEE Transactions on Information Theory, Vol. 46 (2000), pp. 1227-1245.
8. D. Knuth. Seminumerical Algorithms. Addison-Wesley, 1981, pp. 441-462.
9. C. Nevill-Manning. mferring Sequential Structure. PhD thesis, University of Waikato, 1996.
10. J. Storer. Data Compression: Methods and Complexity Issues. PhD Thesis, Princeton University, 1979.
11. T. A. Welch. A Technique for High Performance Data Compression. IEEE Computer, Vol. 17 (June 1984), pp. 8-19.
12. E. Yang and J. C. Kieffer. Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform. IEEE Transactions on Information Theory, Vol. 46 (2000), pp. 755-777.
13. J. Ziv and A. Lempel. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory, Vol. 23 (1977), pp. 337-343.
14. J. Ziv and A. Lempel. Compression of Individual Sequences via Variable-Rate Coding. IEEE Transactions on Information Theory, Vol. 24 (1978), pp. 530-536.