Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Kelly, Benjamin G.; Brailsford, David F. (2006)
Languages: English
Types: Unknown

Classified by OpenAIRE into

In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate’ arithmetic coder, because of its use of an approximation to multiplication. We show that the approximation used in the B-coder has an efficiency cost of 0.003 compared to Shannon entropy. At the heart of the B-coder is an efficient state machine that adapts rapidly to the data to be coded. The adaptation is achieved by allowing a fixed table of transitions and probabilities to change within a given tolerance. The combination of the two techniques gives a coder that out-performs the current state-of-the-art binary arithmetic coders.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] Richard C. Pasco. Source coding algorithms for fast data compression. PhD thesis, Stanford University, Stanford, CA 94305, May 1976.
    • [2] Jorma Rissanen. Generalized Kraft inequality and arithmetic coding. IBM Journal of Research and Development, 20, 1976.
    • [3] Glen G. Langdon, Jr. and Jorma Rissanen. Compression of black-white images with arithmetic coding. IEEE Transactions on Communications, COM-29(6):858-867, June 1981.
    • [4] Jorma Rissanen and Glen G. Langdon, Jr. Universal modeling and coding. IEEE Transactions on Information Theory, 27(1):12-23, Jan 1981.
    • [5] Ian H. Witten, Radford M. Neal, and John G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, 1987.
    • [6] Glen G. Langdon, Jr. and Jorma Rissanen. A simple general binary source code. IEEE Transactions on Communications, IT-28(5):800-803, September 1982.
    • [7] W.B. Pennebaker, J.L. Mitchell, G.G. Langdon, Jr., and R.B. Arps. An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder. IBM Journal of Research and Development, 32(6):717-726, November 1988.
    • [8] William B. Pennebaker and Joan L. Mitchell. JPEG: Still Image Data Compression Standard. Van Nostrang Reinhold, New York, 1993.
    • [9] W.B. Pennebaker and J.L. Mitchell. Probabilty estimation for the Q-Coder. IBM Journal of Research and Development, 32(6):737-751, November 1988.
    • [10] W. Douglas Withers. A rapid probability estimator and binary arithmetic coder. IEEE Transactions on Information Theory, 47(4):1533-1537, May 2001.
    • [11] Leon Bottou, Paul G. Howard, and Yoshua Bengio. The Z-coder adaptive binary coder. In Data Compression Conference, 1998. DCC '98. Proceedings, pages 13-22, March 1998.
    • [12] Solomon W. Golomb. Run-length encodings. IEEE Transactions on Information Theory, IT12(3):399-401, July 1966.
    • [13] The British Broadcasting Corporation. BBC RD technical reports archive. http://www. bbc.co.uk/rd/pubs/reports/index.shtml.
    • [14] William G. Bowen. JSTOR and the economics of scholarly communication. http://www. mellon.org/jsesc.html, 1996. See also: http://www.jstor.org.
    • [15] Mat Hans and Ronald W. Schafer. Lossless compression of digital audio. IEEE Signal Processing Magazine, 18(4):21-32, July 2001.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article