No abstract

No abstract

The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encoding feature present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip. In this paper, we propose to adapt bit recycling to arithmetic code instead of Huffman code. This adaptation enables bit recycling to achieve better compression and a much wider applicability. A theoretical analysis that estimates the average amount of data compression that can be achieved by this adaptation is presented as well.

No abstract