Abstract
Arithmetic coding is a method for data compression. Although the idea was developed in the 1970’s, it wasn’t until the publication of an “accessible implementation” that it achieved the popularity it has today. Over the past ten years arithmetic coding has been refined and its advantages and disadvantages over rival compression schemes, particularly Huffman and Shannon-Fano coding, have been elucidated. Arithmetic coding produces a theoretically optimal compression under much weaker assumptions than Huffman and Shannon-Fano, and can compress within one bit of the limit imposed by Shannon’s Noiseless Coding Theorem. Additionally, arithmetic coding is well suited to adaptive coding schemes, both character and word based. For recent perspectives on the subject.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Haskell 98: A Non-Strict, Purely Functional Language. Available online at http://www.haskell.org/onlinereport
Standard Libraries for Haskell 98. Available online at http://www.haskell.org/onlinelibrary
Bird, R.S.: Introduction to Functional Programming using Haskell. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1998)
Bird, R.S., de Moor, O.: Algebra of Programming. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1997)
Fano, R.M.: Transmission of Information. MIT Press, Cambridge. Wiley, New York (1961)
Gibbons, J.: Origami programming. In: Gibbons, J., de Moor, O. (eds.) The Fun of Programming, Palgrave (2003)
Gibbons, J.: The Third Homomorphism Theorem. J. Functional Prog. 6(4), 657–665 (1996)
Howard, P.G., Vitter, J.S.: Arithmetic coding for data compression. Proc. IEEE 82(6), 857–865 (1994)
Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng. 40(9), 1098–1101 (1952)
Jiang, J.: Novel design of arithmetic coding for data compression. IEE Proc. Comput. Dig. Tech. 142(6), 419–424 (1995)
Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 124–144. Springer, Heidelberg (1991)
Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Trans. on Inf. Systems 16(3), 256–294 (1998)
Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 79–423 (1948)
Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. C. ACM 30(6), 520–540 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bird, R., Gibbons, J. (2003). Arithmetic Coding with Folds and Unfolds. In: Jeuring, J., Jones, S.L.P. (eds) Advanced Functional Programming. AFP 2002. Lecture Notes in Computer Science, vol 2638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44833-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-44833-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40132-2
Online ISBN: 978-3-540-44833-4
eBook Packages: Springer Book Archive