{"id":1393,"date":"2026-09-24T12:11:00","date_gmt":"2026-09-24T12:11:00","guid":{"rendered":"https:\/\/ffritze.de\/?p=1393"},"modified":"2026-09-24T08:32:16","modified_gmt":"2026-09-24T08:32:16","slug":"hamming-code-unplugged-fehlererkennung-und-fehlerkorrektur","status":"publish","type":"post","link":"https:\/\/ffritze.de\/en\/hamming-code-unplugged-fehlererkennung-und-fehlerkorrektur\/","title":{"rendered":"Hamming-Code unplugged \u2013 Error detection and error correction"},"content":{"rendered":"

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.<\/p>\n\n\n\n\n\n\n\n

If data is changed on the go<\/h2>\n\n\n\n
\n
\n

When transmitting digital data, it can happen that individual bits change. A 0 becomes a 1 or vice versa, without the recipient noticing this at first. The Hamming code therefore supplements the actual data with additional check bits. In this way, it is not only possible to see that an error has occurred, but also where it is located.<\/p>\n<\/div>\n\n\n\n

\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

Building the Hamming Code<\/h2>\n\n\n\n

The Hamming code consists of seven bits in the variant used here: four data bits and three check bits. The data bits are at positions 3, 5, 6 and 7, while the test bits are placed at positions 1, 2 and 4. Each test bit controls a specific group of four positions and is chosen so that this group contains an even number of ones. If a bit is changed later, the pattern of the faulty checks shows the position of the wrong bit.<\/p>\n\n\n\n

\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n\n\n\n
\n

Material: Hamming code with coins<\/strong><\/h3>\n\n\n\n
\n
\n

Seven Hamming coins and a suitable template are required for the implementation. The coins are intended for 3D printing<\/strong>; the print files are available as a ZIP file in STL and 3MF format<\/strong> for Download<\/a>.<\/p>\n<\/div>\n\n\n\n

\n
\"\"<\/a><\/figure>\n<\/div>\n<\/div>\n\n\n\n

The template with the positions and test groups can be downloaded as PDF file<\/a> and printed.<\/p>\n<\/div>\n\n\n\n

Seven coins are needed to build the Hamming code. The four data bits<\/strong> d<\/mi>3<\/mn>d_00<\/annotation><\/semantics><\/math> to d<\/mi>3<\/mn>d_3<\/annotation><\/semantics><\/s<\/semantics><\/math>> are represented by blue coins, the three test bits<\/strong> p<\/mi>0<\/mn><\/annotation><\/semantics><\/math> Each coin shows a 0 on one side and a 1 on the other side.<\/p>\n\n\n\n
\n
\n

First, place the four blue data coins in positions 3, 5, 6, and 7. Randomly choose one side for each coin and use it to record the data bits d<\/mi>0<\/mn><\/msub>d_0<\/annotation><\/semantics><\/math> through d<\/mi>3<\/mn><\/msub>d_3<\/annotation><\/semantics><\/math>.<\/p>\n<\/div>\n\n\n\n
\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

The three orange test coins are then placed on positions 1, 2 and 4.<\/p>\n\n\n\n

Each parity bit checks a specific group of positions. p<\/mi>0<\/mn><\/msub>p_0<\/annotation><\/semantics><\/math> checks positions 1, 3, 5, and 7, p<\/mi>1<\/mn><\/msub>p_1<\/annotation><\/semantics><\/math> checks positions 2, 3, 6, and 7, and p<\/mi>2<\/mn><\/msub>p_2<\/annotation><\/semantics><\/math> checks positions 4, 5, 6, and 7.<\/p>\n\n\n\n
\n
\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n\n\n\n
\n

Choose the sides of the orange coins so that there is an even number of A's in each of these test groups. The respective test bit is always counted.<\/p>\n<\/div>\n<\/div>\n\n\n\n

This builds up a valid Hamming code. The seven coins now contain four data bits and three check bits. If a coin is later turned over, the test groups can be used to determine whether an error has occurred and in which position the changed bit is located.<\/p>\n\n\n\n

Detect, locate and correct errors<\/h2>\n\n\n\n
\n
\n

After the Hamming code has been built on the template, first check whether each of the three parity groups contains an even number of ones. p<\/mi>0<\/mn><\/msub>p_0<\/annotation><\/semantics><\/math> covers positions 1, 3, 5, and 7, p<\/mi>1<\/mn><\/msub>p_1<\/annotation><\/semantics><\/math> covers positions 2, 3, 6, and 7, and p<\/mi>2<\/mn><\/msub>p_2<\/annotation><\/semantics><\/math> covers positions 4, 5, 6, and 7. The respective parity bit is included in the count during the check.<\/p>\n<\/div>\n\n\n\n
\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

Now any coin is secretly turned over. Subsequently, the three test groups are checked again. If a test group contains an odd number of As, this shows that there is an error in one of the associated positions. <\/p>\n\n\n\n

\n
\n

The pattern of the faulty parity groups ultimately reveals the exact position of the changed bit. For example, if the parity groups of p<\/mi>0<\/mn><\/msub>p_0<\/annotation><\/semantics><\/math> and p<\/mi>1<\/mn><\/msub>p_1<\/annotation><\/semantics><\/math> are faulty, the error is at position 3, since this position is included in both parity groups.<\/p>\n<\/div>\n\n\n\n
\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

If no faulty test group is found, no coin has been changed. If the faulty position is determined, the corresponding coin is turned over again. This corrects the single bit error and restores the original Hamming code. Subsequently, it can be investigated how the method behaves with several simultaneously modified bits.<\/p>\n\n\n\n

Limits of the procedure<\/h2>\n\n\n\n
\n
\n

The Hamming code can detect, locate and correct a single bit error in this form. However, if several bits or number spinns are changed at the same time, reliable error correction is no longer guaranteed.<\/p>\n<\/div>\n\n\n\n

\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

Three test views show the way to error<\/h2>\n\n\n\n

The procedure works because each of the seven positions has its own three-digit binary representation: position 1 corresponds to 001, position 2 to 010, position 3 to 011, and so on up to position 7, which corresponds to 111. The three parity bits each check one digit of these binary representations. p<\/mi>0<\/mn><\/msub>p_0<\/annotation><\/semantics><\/math> checks the last digit, p<\/mi>1<\/mn><\/msub>p_1<\/annotation><\/semantics><\/math> checks the middle digit, and p<\/mi>2<\/mn><\/msub>p_2<\/annotation><\/semantics><\/math> checks the first digit.<\/p>\n\n\n\n
\n
\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n\n\n\n
\n

If a coin is flipped, the number of ones changes in exactly those parity groups that include its position. The affected parity groups therefore provide the individual digits of the binary representation of the error position. For example, if p<\/mi>0<\/mn><\/msub>p_0<\/annotation><\/semantics><\/math> and p<\/mi>1<\/mn><\/msub>p_1<\/annotation><\/semantics><\/math> are faulty, while p<\/mi>2<\/mn><\/msub>p_2<\/annotation><\/semantics><\/math> remains correct, the result is 011 \u2014 the binary representation of position 3.<\/p>\n<\/div>\n<\/div>\n\n\n\n

The three test results thus together form a so-called test pattern<\/strong>. This test pattern is nothing more than the binary number of the faulty position. Therefore, the Hamming code can not only detect a single bit error, but also clearly locate it and correct it by turning the corresponding coin over again.<\/p>\n\n\n\n

\n

Implementation with Python<\/strong><\/h3>\n\n\n\n
\n
\n

The procedure previously carried out with coins and the template can also be implemented with Python. In a Jupyter notebook, the data bits, check bits and check groups are represented by lists and calculations. <\/p>\n<\/div>\n\n\n\n

\n
\"\"<\/a><\/figure>\n<\/div>\n<\/div>\n\n\n\n

Subsequently, a single bit error can be simulated, located on the basis of the test sample and automatically corrected. The Jupyter Notebook to Hamming-Code<\/a> <\/a>contains the corresponding Python implementation and can be run directly in the browser.<\/p>\n<\/div>\n\n\n\n

Hamming code with more bits<\/h2>\n\n\n\n

The Hamming code can also be extended to longer bit sequences.<\/p>\n\n\n\n

\n
\n

For this purpose, additional test bits are inserted at the positions that correspond to powers of 2, i.e. at positions 1, 2, 4, 8, 16 and so on. The more data bits are transferred, the more test bits are required: For example, a 15-bit code with four check bits are created from 11 data bits, and a 31-bit code with five check bits is created from 26 data bits.<\/p>\n<\/div>\n\n\n\n

\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

Even with these longer codes, the test results can form the binary representation of the faulty position, so that a single bit error can be detected and corrected.<\/p>\n\n\n\n

Result<\/h2>\n\n\n\n
\n
\n

The Hamming code clearly shows how additional test bits help to detect and correct errors in digital data. With the 3D-printed coins, the procedure can initially be built up without a computer and can be traced practically.<\/p>\n<\/div>\n\n\n\n

\n
\"\"\n\t\t\t\n\t\t\t\t\n\t\t\t<\/svg>\n\t\t<\/button><\/figure>\n<\/div>\n<\/div>\n\n\n\n

The subsequent implementation in the Jupyter Notebook demonstrates how this unplugged method can be transformed into an algorithm that automatically locates and corrects errors.<\/p>","protected":false},"excerpt":{"rendered":"

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.<\/p>","protected":false},"author":2,"featured_media":1394,"comment_status":"open","ping_status":"open","sticky":false,"template":"seite-thoughts-beitrag","format":"standard","meta":{"iawp_total_views":4,"footnotes":""},"categories":[19,7,21,34],"tags":[89,92,22,40],"class_list":["post-1393","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-algorithms","category-programs","category-python","category-unplugged","tag-code","tag-hamming","tag-python","tag-unplugged"],"_links":{"self":[{"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/posts\/1393","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/comments?post=1393"}],"version-history":[{"count":0,"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/posts\/1393\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/media\/1394"}],"wp:attachment":[{"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/media?parent=1393"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/categories?post=1393"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ffritze.de\/en\/wp-json\/wp\/v2\/tags?post=1393"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}