arithmetic coding


Also found in: Acronyms, Wikipedia.

arithmetic coding

[¦a·rith¦med·ik ′cōd·iŋ]
(communications)
A method of data compression in which a long character string is represented by a single number whose value is obtained by repeatedly partitioning the range of possible values in proportion to the probabilities of the characters.

arithmetic coding

A statistical data compression method that converts strings of data into single floating point numbers between 0 and 1.
References in periodicals archive ?
This limitation does not apply to Arithmetic Coding.
Arithmetic Coding. IBM Journal of Research and Development, 23(2), 149-162.
According to the theory of arithmetic coding, we find that the self-adaptive arithmetic coding algorithm is exactly a kind of discrete implement for a chaotic cryptosystem.
Masmoudi, "An improved lossless image compression based arithmetic coding using mixture of non-parametric distributions," Multimedia Tools and Applications, vol.
As is shown in Figure 11, the Arithmetic coding is very close to the maximum compression ratio, however, above 40 dB both Huffman and Arithmetic achieve a high performance.
(Lots of current encoding methods are derived from these classical encoding methods and are improved according to special application [10-12].) And the preliminary studies have shown that the universal combinatorial coding has characteristics of tree coding, arithmetic coding, and dictionary coding.
The information theory concepts that the IT-tutor-UV can support at instructional level are: entropy calculation, entropy basic properties, Huffman coding, Arithmetic coding, LZ-77 coding, RS-coding, Hamming coding, convolutional coding, and binary symmetric channel.
During its long gestation in the 1970's and early 1980's, arithmetic coding [Rissanen 1976; Rissanen and Langdon 1979; Rubin 1979; Rissanen and Langdon 1981; Langdon 1984] was widely regarded more as a curiosity than a practical coding technique.
The JPEG proposal specifies two entropy coding methods--Huffman coding [7] and arithmetic coding [14].
Huffman coding assigns fixed bit sequences to input symbols, whereas arithmetic coding features no fixed codes.
Finally, the output of both chain code and DPCM are encoded by arithmetic coding [7].
Hardware architecture for lossless image compression based on context-based modeling and arithmetic coding. In the Proc.