05-compression-02-entropy coding.pptx - ICSY
05-compression-02-entropy coding.pptx - ICSY
05-compression-02-entropy coding.pptx - ICSY
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Arithmetic Coding<br />
} Remarks<br />
- if the alphabet is small and the probabilities are highly unbalanced<br />
arithmetic <strong>coding</strong> is superior to huffman <strong>coding</strong><br />
- efficient arithmetic <strong>coding</strong> implementations exclusively rely on<br />
integer arithmetic<br />
- United States Patent 4,122,440; Method and means for<br />
arithmetic string <strong>coding</strong>; International Business Machines<br />
Corporation; October 24, 1978<br />
- A precise comparison between arithmetic <strong>coding</strong> and huffman<br />
<strong>coding</strong> can be found in [Sayood]<br />
Prof. Dr. Paul Müller, University of Kaiserslautern<br />
31
Change language