Arithmetic Coding with Folds and Unfolds
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.
KeywordsArithmetic Code Current Interval Optimal Compression Int1 Int2 Binary Fraction
Unable to display preview. Download preview PDF.
- 1.Haskell 98: A Non-Strict, Purely Functional Language. Available online at http://www.haskell.org/onlinereport
- 2.Standard Libraries for Haskell 98. Available online at http://www.haskell.org/onlinelibrary
- 3.Bird, R.S.: Introduction to Functional Programming using Haskell. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1998)Google Scholar
- 5.Fano, R.M.: Transmission of Information. MIT Press, Cambridge. Wiley, New York (1961)Google Scholar
- 6.Gibbons, J.: Origami programming. In: Gibbons, J., de Moor, O. (eds.) The Fun of Programming, Palgrave (2003)Google Scholar
- 9.Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng. 40(9), 1098–1101 (1952)Google Scholar
- 11.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)Google Scholar