Unit 3 – Question 2

What other interesting examples of codes from history or the modern-day (digital or non-digital) can you find to inspire or support a lesson about encoding and decoding messages?


Huffman coding is an algorithm that is used for the lossless compression of data. The idea is to assign variable-length codes to all the characters depending on the frequencies of these characters in the given text. The character which occurs most frequently gets the smallest code and the character which occurs least frequently gets the largest code. This algorithm is devised by David Huffman in 1952 but still used today in a variety of important areas. Most of communications in the Internet use Huffman coding. Most of MP3 files and JPEG images also use this coding method.

+ There are no comments

Add yours