Lesson 1.2 Lossless Compression Algorithms


This lesson will cover lossless compression and different encoding and decoding algorithms such as Huffman coding and Arithmetic Coding. These compression algorithms encode an exact copy of the data which can be perfectly reconstructed at the decoding phase. We will go through an example of how each of these algorithms work by looking at a simple example of encoding and decoding with the word ‘HELLO’.

Want to dive deeper into to the code exercises?

Register for a free trial of the Bitmovin Dashboard to get access!