A technique to implement error detection as part of the arithmetic coding process is described. Heuristic arguments are given to show that a small amount of extra redundancy can be very effective in detecting errors very quickly, and practical tests confirm this prediction. On leave from the School of Engineering, University of Manchester, UK. Funded by UK’s Engineering and Physical Sciences Re...

9  Abstract— In this paper, we present a hybrid fractal image compression method for satellite images. The proposed algorithm uses entropy and arithmetic coding. The satellite image is decomposed into low frequency sub-band and high frequency sub-band. The low frequency sub-band uses fractal coding, thus making the low-frequency information loss less which is sensitive to human visual system. ...

This article examines the problem of compressing a uniformly quantized IID source. We present a new compression technique, bit-wise arithmetic coding, that assigns xed length codewords to the quantizer output and uses arithmetic coding to compress the codewords, treating the codeword bits as independent. We examine the performance of this method and evaluate the overhead required when used bloc...

We propose a novel visualisation method for DNA and other long sequences over a small alphabet, which is based on the construction of the family of Rauzy fractals for infinite words. We use this technique to find repeating structures of widely varying length in the input string as well as the identification of coding segments. Other properties of the input can also come to light using this tech...

Multipulse excited linear predictive coding (MPELPC) is a good medium bit-rate speech coding technique. However, due to the enormous processing required for searching the pulse information (pulse positions and amplitudes), many practical implementations of multipulse coders actually utilize some simplified pulse search algorithms such as dropping the amplitude optimization during the search for...

Motivated by recent results in multiple description image coding over wireless networks, we propose a scheme for transmission of multiple descriptions through hybrid packet loss and additive white Gaussian noise channel. Each description is coded into multiple bitstreams by applying SPIHT coding on wavelet trees along spatial orientations and each stream is further compressed using arithmetic c...

This paper proposes a novel entropy encoding technique for lossless data compression. Representing a message string by its lexicographic index in the permutations of its symbols results in a compressed version matching Shannon entropy of the message. Commercial data compression standards make use of Huffman or arithmetic coding at some stage of the compression process. In the proposed method, l...

There are dierent ways to code the geodesic flows on surfaces with negative curvature. Such code spaces give a useful tool to verify the dynamical properties of geodesic flows. Here we consider special subspaces of geodesic flows on Hecke surface whose arithmetic codings varies on a set with innite alphabet. Then we will compare the topological complexity of them by computing their topological ...

An improved Context-based Adaptive Binary Arithmetic Coding (CABAC) is presented in the paper. The idea for the improvement is to use a more accurate mechanism for estimation of symbol probabilities in the standard CABAC algorithm. The authors’ proposal of such a mechanism is based on the Context-Tree Weighting (CTW) technique. In the framework of HEVC video encoder the improved CABAC allows 1....