Efficient Optimal Recompression

Computer Journal

Volumn 40, Issue 2-3, 1997, Pages

  Klein, Shmuel T ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3743064934     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/40.2_and_3.117     Document Type: Article

References (20)

1. Huffman, D. (1952) A method for the construction of minimum redundancy codes. Proc. IRE, 40, 1098-1101.
2. Witten, I. H., Neal, R. M. and Cleary, J. G. (1987) Arithmetic coding for data compression. Commun. ACM, 30, 520-540.
3. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, IT-23, 337-343.
4. Ziv, J. and Lempel, A. (1978) Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, IT-24, 530-536.
5. Bell, T. C. (1986) Better OPM/L text compression. IEEE Trans. Commun., COM-34, 1176-1182.
6. Brent, R. P. (1987) A linear algorithm for data compression. Austral. Comp. J., 19, 64-68.
7. Williams, R. N. (1991) An extremely fast Ziv-Lempel data compression algorithm. Proc. Data Compression Conf. DCC-91, Snowbird, UT, pp. 362-371.
8. Fiala, E. R. and Greene, D. H. (1989) Data compression with finite windows. Commun. ACM, 32, 490-505.
9. Wagner, R. A. (1973) Common phrases and minimum-space text storage. Commun. ACM, 16, 148-152.
10. Storer, J. A. and Szymanski, T. G. (1982) Data compression via textual substitution. J. ACM, 29, 928-951.
11. Hirschberg, D. S. and Stauffer, L. M. (1994) Parsing algorithms for dictionary compression on the PRAM. Proc. Data Compression Conf. DCC-94, Snowbird, UT, pp. 136-145.
12. Horspool, R. N. (1995) The effect of non-greedy parsing in Ziv-Lempel compression methods. Proc. Data Compression Conf. DCC-95, Snowbird, UT, pp. 302-311.
13. Katajainen, J. and Raita, T. (1992) An analysis of the longest match and the greedy heuristics in text encoding. J. ACM, 39, 281-294.
14. Schuegraf, E. J. and Heaps, H. S. (1974) A comparison of algorithms for data base compression by use of fragments as language elements. Inform. Storage Retrieval, 10, 309-319.
15. Katajainen, J. and Raita, T. (1989) An approximation algorithm for space-optimal encoding of a text. Comp. J., 32, 228-237.
16. Whiting, D. L., George, G. A. and Ivey, G. E. (1992) Data Compression Apparatus and Method, US Patent 5 126 739.
17. Even, S. (1979) Graph Algorithms. Computer Science Press, Rockville, MD.
18. Dijkstra, E. W. (1959) A note on two problems in connexion with graphs. Num. Math., 1, 269-271.
19. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990) Introduction to Algorithms. MIT Press, Cambridge, MA.
20. Bell, T. C., Cleary, J. G. and Witten, I. A. (1990) Text Compression. Prentice-Hall, Englewood Cliffs, NJ.