- Arithmetic coding surpasses the Huffman techniques in its compression ability.
- The Huffman method assigns an integral number of bits to each symbol, while arithmetic coding assigns one log code to the entire input string.
- Arithmetic coding consists of a few arithmetic operations due to its complexity is less.
- In terms of complexity, arithmetic coding is asymptotically better than Huffman coding.