On the complexity of optimal grammar-based compression

Data Compression Conference Proceedings

Volumn , Issue , 2006, Pages 173-182

  Arpe, Jan ^a   Reischuk, Rüdiger ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY STRING; BLOCK CODING; GRAMMAR-BASED COMPRESSION; LOWER BOUNDS; NP COMPLETE; NP-HARD; POLYNOMIAL-TIME ALGORITHMS;

COMPUTATIONAL COMPLEXITY; CONTROL THEORY; POLYNOMIAL APPROXIMATION;

DATA COMPRESSION;

EID: 65749108499     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2006.59     Document Type: Conference Paper

References (11)

1. A. Apostolico and S. Lonardi. Some Theory and Practice of Greedy Off-line Textual Substitution. In Proc. IEEE Data Compression Conference 1998, p. 119-128.
2. J. Arpe and R. Reischuk. On the Complexity of Optimal Grammar-Based Compression. Tech. Report SIIM-TR-A-04-14, Universität zu Lübeck, 2004, available at http://www.tcs.uni-luebeck.de/Forschung/A0414.ps.
3. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The Smallest Grammar Problem. IEEE Trans. Inform. Theory, 51(7):2554-2567, 2005.
4. J. Kieffer and E. Yang. Grammar Based Codes: A New Class pf Universal Lossless Source Codes. IEEE Trans. Inform. Theory, IT-46(3):737-754, 2000.
5. N. Larsson and A. Moffat. Offline Dictionary-Based Compression. Proc. IEEE, 88(11):1722-1732, 2000.
6. C. Nevill-Manning and I. Witten. Compression and explanation using hierarchical grammars. Computer Journal, 40(2/3):103-116, 1997. (Pubitemid 127563606)
7. W. Rytter. Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. Theoret. Comput. Sci., 302(1-3):211-222, 2003.
8. J. Storer. NP-completeness results concerning data compression. Technical Report 234, Dep. of Electrical Engineering and Computer Science, Princeton Univ., Princeton, N.J., 1977.
9. J. Storer and T. Szymanski. Data Compression via Textual Substitution. JACM, 29(4):928-951, 1982. (Pubitemid 13450119)
10. J. Ziv and A. Lempel. A Universal Algorithm for Sequential Data Compression. IEEE Trans. Inform. Theory, IT-23(3):337-343, 1977.
11. J. Ziv and A. Lempel. Compression of Individual Sequences via Variable-Rate Coding. IEEE Trans. Inform. Theory, IT-24(5):530-536, 1978. (Pubitemid 8631609)