Skip to main content
Springer Nature Link
Log in

Fast and Space-Efficient Adaptive Arithmetic Coding⋆

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1746))

Included in the following conference series:

  • 488 Accesses

Abstract

We consider the problem of constructing an adaptive arithmetic code in the case when the source alphabet is large. A method is suggested whose coding time is less in order of magnitude than that for known methods. We also suggest an implementation of the method by using a data structure called “imaginary sliding window”, which allows to significantly reduce the memory size of the encoder and decoder.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Jelinek, F.: Probabilistic Information Theory. New York: McGraw-Hill (1968) 476–489

    MATH  Google Scholar 

  2. Rissanen, J.J.: Generalized Kraft inequality and arithmetic coding. IBM J. Res. Dev. 20 (1976) 198–203

    Article  MathSciNet  Google Scholar 

  3. Pasco, R.: Source coding algorithm for fast data compression. Ph. D. thesis, Dept. Elect. Eng., Stanford Univ., Stanford, CA (1976)

    Google Scholar 

  4. Rubin, F.: Arithmetic stream coding using fixed precision registers. IEEE Trans. Inform. Theory 25,6 (1979) 672–675

    Article  MathSciNet  Google Scholar 

  5. Rissanen, J.J., Langdon, G.G.: Arithmetic coding. IBM J. Res. Dev. 23,2 (1979) 149–162

    Article  MathSciNet  Google Scholar 

  6. Guazzo, M.: A general minimum-redundancy source-coding algorithm. IEEE Trans. Inform. Theory 26,1 (1980) 15–25

    Article  MathSciNet  Google Scholar 

  7. Witten, I.H., Neal, R., Cleary, J.G.: Arithmetic coding for data compression. Comm. ACM 30,6 (1987) 520–540

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  9. Rissanen J., Langdon G.G.: Universal modeling and coding. IEEE Trans. Inform. Theory 27, 1 (1981) 12–23

    Article  MathSciNet  Google Scholar 

  10. Cleary, J.G., Witten, I.H.: Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. 32, 4 (1984) 396–402

    Article  Google Scholar 

  11. Moffat, A.: A note on the PPM data compression algorithm. Res. Rep. 88/7, Dep. Comput. Sci., Univ. of Melbourne, Australia, 1988.

    Google Scholar 

  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

    Article  Google Scholar 

  13. Ryabko, B.Y.: The imaginary sliding window. IEEE Int. Symp. on Information Theory. Ulm (1997) 63

    Google Scholar 

  14. Krichevsky, R.: Universal Compression and Retrieval. Dordrecht: Kluwer Academic Publishers (1994)

    Book  Google Scholar 

  15. Feller, W.: An Introduction to Probability Theory and Its Applications. New York: Wiley & Sons (1970)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian State University of Telecommunications and Information Sciences, Kirov St. 86, Novosibirsk, 630102, Russia

    Boris Ryabko & Andrei Fionov

Authors
  1. Boris Ryabko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Fionov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Vodafone Limited, The Courtyard, 2-4 London Road Newbury, Berkshire, RG14 1JX, UK

    Michael Walker

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryabko, B., Fionov, A. (1999). Fast and Space-Efficient Adaptive Arithmetic Coding⋆. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics