Source coding algorithms for fast data compression.
Source coding algorithms for fast data compression.
The centroid method for compressing sets of similar images
Pattern Recognition Letters
New arithmetic coder/decoder architectures based on pipelining
ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Syntax-based arithmetic video coding for very low bit rate visual telephony
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
Low Delay Perceptually Lossless Coding of Audio Signals
DCC '01 Proceedings of the Data Compression Conference
Titan-R: A Multigigabit Reconfigurable Combined Compression/Decompression Unit
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Enhancing secrecy by data compression: theoretical and practical aspects
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Piecewise approximation of contours through scale-space selection of dominant points
IEEE Transactions on Image Processing
High-speed arithmetic coder/decoder architectures
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Area efficient VLSI architectures for Huffman coding
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
On the theory and applications of sequence based estimation of independent binomial random variables
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
| Hi-index | 0.00 |
Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per iteration or recursion. On each recursion, the algorithm successively partitions an interval of the number line between 0 and 1, and retains one of the partitions as the new interval. Thus, the algorithm successively deals with smaller intervals, and the code string, viewed as a magnitude, lies in each of the nested intervals. The data string is recovered by using magnitude comparisons on the code string to recreate how the encoder must have successively partitioned and retained each nested subinterval. Arithmetic coding differs considerably from the more familiar compression coding techniques, such as prefix (Huffman) codes. Also, it should not be confused with error control coding, whose object is to detect and correct errors in computer operations. This paper presents the key notions of arithmetic compression coding by means of simple examples.