Arithmetic coding is used in most media compression methods. Context modeling usually done through frequency counting and look-up tables (LUTs). For long-memory signals, probability with large context sizes often infeasible. Recently, neural networks have been to model probabilities of contexts order drive arithmetic coders. These trained offline. We introduce an <italic xmlns:mml="http://www.w...

A cyclic arithmetic code is a subgroup of Z/(rn − 1)Z, where the weight of a word x is the minimal number of nonzero coefficients in the representation x ≡ ∑n−1 i=0 cir with |ci| < r for all i. A code is called equidistant if all codewords have the same weight. In this paper necessary conditions for the existence of equidistant codes are given. By relating these conditions to character sums on ...

Several methods exist for adaptation to non-stationarystatistics in histogram modelling. Among the techniques that perform local adaptation by decaying histogram counts, we show that fixed decay rate schemes are sub-optimal. We use an order-0 model and an arithmetic coder to demonstrate that improved performance can be obtained by using a variable decay rate scheme that uses the derivative of t...

In this paper we give a short theoretical description of the general predictive adaptive arithmetic coding technique. The links between this technique and the works of J. Rissanen in the 80’s, in particular the BIC information criterion used in parametrical model selection problems, are established. We also design lossless and lossy coding techniques of images. The lossless technique uses a mix...

Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, this paper proposed a Joint Source-Cryptographic-Channel Coding (JSCC) based on Arithmetic Coding (AC). For this purpose, embedded error detection arithmetic coding, which is known as continuous error detection (CED), is used. In our proposed method, a random length ...

An Improved Adaptive Arithmetic Coding is presented in the paper to be applicable in contemporary hybrid video encoders. The proposed Adaptive Arithmetic Encoder makes the improvement of the state-of-the-art Context-based Adaptive Binary Arithmetic Coding (CABAC) method that is used in the new worldwide video compression standard MPEG-4 AVC/H.264. The improvements were obtained by the use of mo...

Arithmetic Coding (AC) is widely used for the entropy coding of text and video data. It involves recursive partitioning of the range [0,1) in accordance with the relative probabilities of occurrence of the input symbols. A data (image or video) encryption scheme based on arithmetic coding called as Chaotic Arithmetic Coding (CAC) has been presented in previous works. In CAC, a large number of c...

Considering a small image region and specifying a joint probability distribution which describes the likelihood of nding a speciic pattern in this image region, arithmetic coding can provide an optimum code that reaches the Shannon limit for the given probability distribution. Data compression is thus reduced to estimating joint probability distributions of patterns. This paper demonstrates how...

In the paper ultimately efficient image lossless coding methods are described. They are based on least-squares adaptive prediction, possibly combined with normalized LMS algorithm. Their performance is comparable to that of TMW, and MRP 0.5 techniques, while their computational complexities are smaller than those for the two reference methods. The new algorithms are supported by an advanced ada...