Investigation of block-sorting of multiset permutations

References

• Arnavut Z (1995) Permutations techniques in lossless compression Ph. D. dissertation, University of Nebraska-Lincoln Lincoln NE USA
   Google Scholar
• Arnavut Z Magliveras S (1997) Block-Sorting and compression Proceedings of Data Compression Conference Snowbird, Utah, March 25–27 IEEE Computer Society Press 181 190
   Google Scholar
• Arnavut , Z and Magliveras , S . (1997) . Lexical permutation sorting algorithm . The Computer Journal , 40 ( 5 ) : 292 – 295 .
   Google Scholar
• Arnavut Z et al. (1998) Block-Sorting transformations Proceeding of Data Compression Conference Snowbird Utah, March 30 - April 1 IEEE Computer Society Press 524
   Google Scholar
• 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
   Google Scholar
• Arnavut , Z . (2003) . Inversion coding . The Computer Journal , 47 ( 1 ) : 46 – 57 .
   Google Scholar
• 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 .
   Google Scholar
• Bentley JL et al. (1986) A locally adaptive data compression scheme Communications of the ACM 29 4 320 330
   Web of Science ®Google Scholar
• Burrows M Wheeler JD (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, )
   Google Scholar
• 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
   Google Scholar
• Cormen HT Leiserson CE Riverst LR (1986) Introduction to Algorithms, McGraw-Hill
   Google Scholar
• Deorowicz , S . (2000) . Improvements to burrows-wheeler compression algorithm . Software-Practice and Experience , 30 ( 13 ) : 1465 – 1483 .
   Google Scholar
• Deorowicz , S . (2001) . Second step algorithms in the burrows-wheeler compression algorithm . Software-Practice and Experience , 32 ( 2 ) : 99 – 111 .
   Google Scholar
• 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 .
   Google Scholar
• Fenwick , P . (1996) . The burrows-wheeler transform for Block-Sorting text compression: principles and improvements . The Computer Journal , 39 ( 9 ) : 731 – 740 .
   Google Scholar
• Huffman , D . (1952) . A method for construction of minimum redundancy codes . Proceedings of the IRE , 40 : 1098 – 1101 .
   Google Scholar
• Isal RYK Moffat A (2001) Parsing Strategies for BWT compression Proceedings of Data Compression Conference Snowbird, Utah, March 27–30 IEEE Computer Society Press 429 438
   Google Scholar
• 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
   Google Scholar
• Schindler M (1998) Block-Sorting Algorithm Private Communicatio
   Google Scholar
• Seward J (1997) The Bzip2 program, vers. 0.1pl2 http://www.muraroa.demon.co.uk.
   Google Scholar
• Wirth IA 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
   Google Scholar
• Witten , IH , Radford , NM and Cleary , GJ . (1987) . Arithmetic coding for data compression . Communications of ACM , 30 ( 6 ) : 520 – 540 .
   Web of Science ®Google Scholar
• Yokoo , H . (1999) . Notes on Block-Sorting data compression . Electronics and Communications in Japan , 82 ( 6 ) : 18 – 25 .
   Google Scholar