Abstract: Coding represents the transformation of some message or generally an object in the way that
symbols (letters, numbers, pixels, ....) of that object being replaced with symbols of some other
alphabet (for example, letters being replaced with numbers). Methods of entropy coding perform
coding without loss, i.e. lossless compression. They are based directly on information theory. In
addition, some of the methods achieve very efficient compression ratio which makes them ideal
for coding when it is important to keep the original form of the content. In this thesis, five
methods of entropy coding are presented: Shannon-Fano coding algorithm, Huffman coding
algorithm, arithmetic coding algorithm, dictionary methods, and simple repetition suppression.
Publication Year: 2016
Publication Date: 2016-10-01
Language: en
Type: dissertation
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot