Inversion Coding

Computer Journal

Volumn 47, Issue 1, 2004, Pages 46-57

  Arnavut, Ziya ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DATA COMPRESSION; DATA STORAGE EQUIPMENT; IMAGE ANALYSIS; KNOWLEDGE ENGINEERING; OPTIMIZATION;

INVERSION CODING; MEMORY-EFFICIENT ALGORITHMS; RECENCY RANKING;

ENCODING (SYMBOLS);

EID: 0346685896     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.1.46     Document Type: Article

References (24)

1. Burrows, M. and Wheeler, D. J. (1994) A Block-sorting Lossless Data Compression Algorithm. SRC Research Report 124, Digital Systems Research Center, Palo Alto, CA, gatekeeper.dec.com, /pub/DEC/SRC/research-reports/SRC-124.ps.Z.
2. Bentley, J. L. et al. (1986) A locally adaptive data compression scheme. Commun. ACM, 29(4), 320-330.
3. Elias, P. (1987) Interval and recency rank source coding: two on-line adaptive variable-length schemes. IEEE Trans. Inform. Theory, IT-33(1), 3-10.
4. Seward, J. (1997) The Bzip2 program, version 0.1pl2. http://www.muraroa.demon.co.uk.
5. Schindler, M. (1997) A fast block-sorting algorithm for lossless data compression. In Proc. Data Compression Conf., Snowbird, Utah, March 25-27, p. 469. IEEE Computer Society Press.
6. Fenwick, P. (1996) The Burrows-Wheeler Transform for block sorting text compression: principles and improvements. Comp. J., 39(9), 731-740.
7. Balkenhol, B. and Kurtz, S. (2000) Universal data compression based on the Burrows-Wheeler Transformation: theory and practice. IEEE Trans. Comput., 49(10), 1043-1053.
8. Chapin, B. (2000) Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data. In Proc. Data Compression Conf., Snowbird, Utah, March 28-31, pp. 183-192. IEEE Computer Society Press.
9. Deorowicz, S. (2001) Second step algorithms in the Burrows-Wheeler Compression Algorithm. Software Prac. Exp., 32(2), 99-111.
10. Isal, R. Y. K. and Moffat, A. (2001) Parsing strategies for BWT compression. In Proc. Data Compression Conf., Snowbird, Utah, March 27-30, pp. 429-438. IEEE Computer Society Press.
11. Wirth, A. I. and Moffat, A. (2001) Can we do without ranks in Burrows-Wheeler Transform? In Proc. Data Compression Con., Snowbird, Utah, March 27-29, pp. 419-428. IEEE Computer Society Press.
12. Arnavut, Z. (1995) Permutations Techniques in Lossless Compression. Ph.D. dissertation, University of Nebraska-Lincoln, Lincoln, NE, USA.
13. Arnavut, Z. and Magliveras, S. (1997) Block sorting and compression. In Proc. Data Compression Conf., Snowbird, Utah, March 25-27, pp. 181-190. IEEE Computer Society Press.
14. Arnavut, Z. (2000) Move-to-Front and inversion coding. In Proc. Data Compression Conf., Snowbird, Utah, March 28-30, pp. 193-202. IEEE Computer Society Press.
15. Amavut, Z. (2002) Generalization of the Burrows-Wheeler Transformation and inversion ranks. In Proc. Data Compression Conf., Snowbird, Utah, April 2-4, p. 451. IEEE Computer Society Press.
16. Knuth, D. (1973) The Art of Computer Programming, Vol. 3. Addison-Wesley Publishing Company, Reading, MA.
17. Sedgewick, R. (1977) Permutation generation methods: a review. ACM Comput. Surveys, 9(2), 137-164.
18. Lehmer, D. H. (1960) Teaching combinatorial tricks to a computer. In Proc. Symp. Appl. Math., Combinatorial Analysis, Providence, RI, Vol. 10, pp. 179-193. American Mathematical Society.
19. Lehmer, D. H. (1964) The Machine Tools of Combinatorics. Applied Combinatorial Mathematics, John Wiley and Sons, Inc., NY.
20. Martin, H. W. (1990) Transformation between tree permutations and inversion tables. In Proc. ACM 18th Annual Comp. Sc. Conf., Washington, DC, May 1990, pp. 140-146. ACM Press.
21. Martin, H. W. (1997) O(n log n) Time Transformations between Permutations and Inversion Tables, private communication.
22. Rissanen, J. and Langdon, G. G. (1981) Universal modeling and coding. IEEE Trans. Inform. Theory, 27(1), 12-22.
23. Witten, I. H., Radford, M. N. and Cleary, J. G. (1987) Arithmetic coding for data compression. Commun. ACM, 30(6), 520-540.
24. Deorowicz, S. (2000) Improvements to Burrows-Wheeler Compression Algorithm. Software Prac. Exp., 30(13), 1465-1483.