FamousWhy Editor:
'Arithmetic coding and decoding' is an ANSI C compression implementation of the arithmetic coding algorithm. Anyone familiar with ANSI C and the arithmetic coding algorithm should be able to use this implementation.

Arithmetic coding is a form of variable-length entropy encoding used in lossless data compression. Normally, a string of characters is represented using a fixed number of bits per character, as in the ASCII code. When a string is converted to arithmetic encoding, frequently used characters will be stored with fewer bits and not-so-frequently occurring characters will be stored with more bits, resulting in fewer bits used in total.

'Arithmetic coding and decoding' is similar to Huffman coding; they both achieve their compression by reducing the average number of bits required to represent a symbol.

In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.

Features:

- Encoding Strings - By assigning each symbol its own unique probability range, it's possible to encode a single symbol by its range;
- Decoding Strings - The decoding process must start with a an encoded value representing a string;
- Order-n Models - This arithmetic coding algorithm is an order-0 zero algorithm. The probability ranges for a symbol are dependent upon 0 preceding symbols.

- Computing Probability Ranges – The developers have implemented both static and adaptive order-0 probability models.
- Limiting Computations to N Bits – This software has a way of representing floating point values as an infinite stream of bits and another way of scaling our probability ranges to N - 2 bits, so it can encode and decode using the scaled values
- Stopping the Encoding Process
- Stopping the Decoding Process
- Static vs. Adaptive Models - The arithmetic coding algorithm is well suited for both static and adaptive probability models
- Portability – The software should build correctly on any machine with an ANSI C compiler

Why is Arithmetic famous?

'Arithmetic coding and decoding' is famous because it is a great ANSI C compression implementation of the arithmetic coding algorithm.

Publisher: Michael Dipperstein

Tags: mathematiacl encoding, arithmetic decoding,