Investigation of block-sorting of multiset permutations

International Journal of Computer Mathematics

Volumn 81, Issue 10, 2004, Pages 1213-1222

  Arnavut, Ziya ^a   Arnavut, Meral ^a  

^a STATE UNIVERSITY OF NEW YORK AT FREDONIA   (United States)

Author keywords

Block sorting; BWT transformation; Lossless compression; Multiset permutations

Indexed keywords

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; PATTERN MATCHING;

BLOCK-SORTING; BWT TRANSFORMATION; LOSSLESS COMPRESSION; MULTISET PERMUTATION;

DATA COMPRESSION;

EID: 28244490517     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160410001712279     Document Type: Article

References (23)

1. Arnavut, Z. (1995). Permutations techniques in lossless compression. Ph. D. dissertation, University of Nebraska-Lincoln, Lincoln, NE, USA.
2. Arnavut, Z. and Magliveras, S. (1997). Block-Sorting and compression. Proceedings of Data Compression Conference, Snowbird, Utah, March 25-27, IEEE Computer Society Press, 181-190.
3. Arnavut, Z. and Magliveras, S. (1997). Lexical permutation sorting algorithm. The Computer Journal, 40(5), 292-295.
4. Arnavut, Z. et al. (1998). Block-Sorting transformations. Proceeding of Data Compression Conference, Snowbird Utah, March 30 - April 1, IEEE Computer Society Press, 524.
5. Arnavut, Z. (2002). Generalization of the burrows-wheeler transformation and inversion ranks. Proceeding of Data Compression Conference, Snowbird Utah, April 2-4, IEEE Computer Society Press, 447.
6. Arnavut, Z. (2003). Inversion coding. The Computer Journal, 47(1), 46-57.
7. Balkenhol, B. and Kurtz, S. (2000). Universal data compression based on the Burrows-Wheeler transformation: theory and practice. IEEE Transactions on Computers, 49(1), 1043-1053.
8. Bentley, J. L. et al. (1986). A locally adaptive data compression scheme. Communications of the ACM, 29(4), 320-330.
9. Burrows, M. and Wheeler, J. D. (1994). A Block-Sorting lossless data compression algorithm. SRC Research Report 124, Digital Systems Research Center, Palo Alto, CA, May 1994 (ftp site: gatekeeper.dec.com, /pub/DEC/SRC/research- reports/SRC-124.ps.Z)
10. Chapin, B. (2000). Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data. Proceedings of Data Compression Conference, Snowbird, Utah, March 28-31, IEEE Computer Society Press, 183-192.
11. Cormen, H. T. Leiserson, C. E. and Riverst, L. R. (1986). Introduction to Algorithms. McGraw-Hill.
12. Deorowicz, S. (2000). Improvements to burrows-wheeler compression algorithm. Software-Practice and Experience, 30(13), 1465-1483.
13. Deorowicz, S. (2001). Second step algorithms in the burrows-wheeler compression algorithm. Software-Practice and Experience, 32(2), 99-111.
14. Elias, P. (1987). Interval and recency rank source coding: two on-line adaptive variable-length schemes. IEEE Transactions on Information Theory, IT-33(10), 3-10.
15. Fenwick, P. (1996). The burrows-wheeler transform for Block-Sorting text compression: principles and improvements. The Computer Journal, 39(9), 731-740.
16. Huffman, D. (1952). A method for construction of minimum redundancy codes. Proceedings of the IRE, 40, 1098-1101.
17. Isal, R. Y. K. and Moffat, A. (2001). Parsing Strategies for BWT compression, Proceedings of Data Compression Conference, Snowbird, Utah, March 27-30, IEEE Computer Society Press, 429-4-38.
18. Schindler, M. (1997). A fast Block-Sorting algorithm for lossless data compression. Proceedings of Data Compression Conference, Snowbird, Utah, March 25-27, IEEE Computer Society Press, 469.
19. Schindler, M. (1998). Block-Sorting Algorithm. Private Communication.
20. Seward, J. (1997). The Bzip2 program, vers. 0.1p12. http://www.muraroa. demon.co.uk.
21. Wirth, I. A. and Moffat, A. (2001). Can we do without ranks in Burrows Wheeler Transform? Proceedings of Data Compression Conference, Snowbird, Utah, March 27-29, IEEE Computer Society Press, 419-428.
22. Witten, I. H. Radford, N. M. and Cleary, G. J. (1987). Arithmetic coding for data compression. Communications of ACM, 30(6), 520-540.
23. Yokoo, H. (1999). Notes on Block-Sorting data compression. Electronics and Communications in Japan, 82(6), 18-25.