In this article, the Hamming code is first built with seven coins and without a computer and tested practically. You will learn how test bits can detect errors in a transferred bit sequence and determine the faulty position. The procedure is then programmed in a Jupyter notebook with Python.
(more…)code
-
Compressing Data with Smarts (Part 1) – The Huffman Algorithm Explained Simply
Conventional computer codes give each letter the same storage space - the common 'E' consumes as much as the rare 'K'.
The Huffman algorithm chooses a smarter way: frequent characters get very short codes, rare a little longer. Thus, the amount of data shrinks without any loss of information.
How to create an elegant Huffman tree from character frequencies step by step, let's look directly at the example word: KAFFEPAUSE.
(more…)