The B-coder: an improved binary arithmetic coder and probability estimator

Kelly, Benjamin G. and Brailsford, David F. (2006) The B-coder: an improved binary arithmetic coder and probability estimator. In: Data Compression Conference 2006 (DCC 2006), 28-30 March 2006, Snowbird, Utah.

Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (Poster)
Additional Information: Poster derived from paper published in: Proceedings of the Data Compression Conference (DCC’06). IEEE Computer Society, 2006, ISBN: 0-7695-2545-8, pp. 456, doi: 10.1109/DCC.2006.76
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Brailsford, Prof David
Date Deposited: 16 Mar 2015 22:26
Last Modified: 04 May 2020 16:26

Actions (Archive Staff Only)

Edit View Edit View