Fast and space-efficient adaptive arithmetic coding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1746, Issue , 1999, Pages 270-279

  Ryabko, Boris ^a   Fionov, Andrei ^a  

^a SIBERIAN STATE UNIVERSITY OF TELECOMMUNICATIONS AND INFORMATION SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ADAPTIVE ARITHMETIC CODING; MEMORY SIZE; SLIDING WINDOW; SPACE EFFICIENT;

CODES (SYMBOLS);

EID: 84888077452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46665-7_31     Document Type: Conference Paper

References (15)

1. Jelinek, F.: Probabilistic Information Theory. New York: McGraw-Hill (1968) 476- 489
2. Rissanen, J. J.: Generalized Kraft inequality and arithmetic coding. IBM J. Res. Dev. 20 (1976) 198-203
3. Pasco, R.: Source coding algorithm for fast data compression. Ph. D. thesis, Dept. Elect. Eng., Stanford Univ., Stanford, CA (1976)
4. Rubin, F.: Arithmetic stream coding using fixed precision registers. IEEE Trans. Inform. Theory 25, 6 (1979) 672-675
5. Rissanen, J. J., Langdon, G. G.: Arithmetic coding. IBM J. Res. Dev. 23, 2 (1979) 149-162
6. Guazzo, M.: A general minimum-redundancy source-coding algorithm. IEEE Trans. Inform. Theory 26, 1 (1980) 15-25
7. Witten, I. H., Neal, R., Cleary, J. G.: Arithmetic coding for data compression. Comm. ACM 30, 6 (1987) 520-540
8. Ryabko, B. Y., Fionov, A. N.: Homophonic coding with logarithmic memory size. Algorithms and Computation. Berlin: Springer (1997) 253-262 (Lecture notes in comput. sci.: Vol. 1350)
9. Rissanen J., Langdon G. G.: Universal modeling and coding. IEEE Trans. Inform. Theory 27, 1 (1981) 12-23
10. Cleary, J. G., Witten, I. H.: Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. 32, 4 (1984) 396-402
11. Moffat, A.: A note on the PPM data compression algorithm. Res. Rep. 88/7, Dep. Comput. Sci., Univ. of Melbourne, Australia, 1988.
12. Willems, F. M. J., Shtarkov, Y. M., Tjalkens, T. J.: The context-tree weighting method: Basic properties. IEEE Trans. Inform. Theory 41, 3 (1995) 653-664
13. Ryabko, B. Y.: The imaginary sliding window. IEEE Int. Symp. on Information Theory. Ulm (1997) 63
14. Krichevsky, R.: Universal Compression and Retrieval. Dordrecht: Kluwer Academic Publishers (1994)
15. Feller, W.: An Introduction to Probability Theory and Its Applications. New York: Wiley & Sons (1970)