Context trees of block sorting compression

Data Compression Conference Proceedings

Volumn , Issue , 1998, Pages 189-198

  Larsson, N Jesper ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; PERFORMANCE; SORTING; TREES (MATHEMATICS);

BLOCK SORTING COMPRESSION; BURROWS-WHEELER TRANSFORM; COMPUTATIONAL EFFICIENCY; CONTEXT TREES; SUFFIX TREE;

DATA COMPRESSION;

EID: 0031705159     PISSN: 10680314     EISSN: None     Source Type: None    
DOI: 10.1109/DCC.1998.672147     Document Type: Conference Paper

References (14)

1. A. Andersson N. J. Larsson K. Swanson Suffix trees on words, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science 1075 102 115 Lecture Notes in Computer Science 1996-June
2. Z. Arnavut S. S. Magliveras Block sorting and compression Proceedings of the IEEE Data Compression Conference 181 190 Proceedings of the IEEE Data Compression Conference 1997-March
3. M. Burrows D. J. Wheeler A block-sorting lossless data compression algorithm May 1994 California, Palo Alto 124 Digital Systems Research Center
4. J. G. Cleary W. J. Teahan I. H. Witten Unbounded length contexts for PPM Proceedings of the IEEE Data Compression Conference 52 61 Proceedings of the IEEE Data Compression Conference 1995-March
5. J. G. Cleary I. H. Witten Data compression using adaptive coding and partial string matching IEEE Transactions on Communications COM-32 396 402 1984
6. M. Farach Optimal suffix tree construction with large alphabets Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science 137 143 Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science 1997-October
7. P. Fenwick Block sorting text compression Proceedings of the 19th Australasian Computer Science Conference Proceedings of the 19th Australasian Computer Science Conference Melbourne Australia 1996-January-February
8. P. G. Howard The design and analysis of efficient lossless data compression systems June 1993 Brown University Rhode Island, Providence
9. N. J. Larsson Extended application of suffix trees to data compression Proceedings of the IEEE Data Compression Conference 190 199 Proceedings of the IEEE Data Compression Conference 1996-March-April
10. M Edward McCreight, A space-economical suffix tree construcion algorithm Journal of the ACM 23 2 262 272 1976
11. A. Moffat Implementing the PPM data compression scheme IEEE Transactions on Communications COM-38 11 1917 1921 1990
12. J. Seward 1997 bzip2 program http://www.muraroa.demon.co.uk/
13. E. Ukkonen On-line construction of suffix trees Algorithmica 14 3 249 260 1995
14. D. Wheeler An implementation of block coding October 1995 Cambridge University Computer Laboratory