1994/06/01 by P.G. Howard, Jeffrey Scott Vitter · 2 citations
Computer Science · Mathematics · #Algorithms and Data Compression #Numerical Methods and Algorithms #Error Correcting Code Techniques #Arithmetic coding #Arithmetic #Coding (social sciences) #Computer science #Arbitrary-precision arithmetic #Huffman coding #Data compression #Redundancy (engineering) #Variable-length code #Theoretical computer science #Context-adaptive binary arithmetic coding #Algorithm #Mathematics #Statistics #Decoding methods
paper · doi:10.1109/5.286189
openalex publication_date 1994/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Arithmetic coding provides an effective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding works and describe an efficient implementation that uses table lookup as a first alternative to arithmetic operations. The reduced-precision arithmetic has a provably negligible effect on the amount of compression achieved. We can speed up the implementation further by use of parallel processing. We discuss the role of probability models and how they provide probability information to the arithmetic coder. We conclude with perspectives on the comparative advantages and disadvantages of arithmetic coding.>