# Hamming's Code

DevFeed: [Hamming's Code](<https://devfeed.tech/articles/hamming-s-code-40378.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2015/03/02/hammings-code/>)

Published: 2015-03-02T09:00:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Code](<https://devfeed.tech/topics/code.md>), [Encoding](<https://devfeed.tech/topics/encoding.md>), [digital](<https://devfeed.tech/topics/digital.md>)

Tags: [coding-theory](<https://devfeed.tech/tags/coding-theory.md>), [compression](<https://devfeed.tech/tags/compression.md>), [computing](<https://devfeed.tech/tags/computing.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [error](<https://devfeed.tech/tags/error.md>), [errors](<https://devfeed.tech/tags/errors.md>), [finite-fields](<https://devfeed.tech/tags/finite-fields.md>), [hamming](<https://devfeed.tech/tags/hamming.md>), [hamming-code](<https://devfeed.tech/tags/hamming-code.md>), [hypercube](<https://devfeed.tech/tags/hypercube.md>), [information-theory](<https://devfeed.tech/tags/information-theory.md>), [linear-algebra](<https://devfeed.tech/tags/linear-algebra.md>), [linear-codes](<https://devfeed.tech/tags/linear-codes.md>), [np-hard](<https://devfeed.tech/tags/np-hard.md>), [reed-solomon-codes](<https://devfeed.tech/tags/reed-solomon-codes.md>), [solved](<https://devfeed.tech/tags/solved.md>), [transmission](<https://devfeed.tech/tags/transmission.md>)

## AI overview

This tutorial introduces Hamming codes as efficiently computable encoding schemes for detecting and correcting errors caused by noise during digital transmission. It defines a code as a subset of binary strings and relates codewords to an injective encoding function.

## Source excerpt

Or how to detect and correct errors Last time we made a quick tour through the main theorems of Claude Shannon, which essentially solved the following two problems about communicating over a digital channel. What is the best encoding for information when you are guaranteed that your communication channel is error free? Are there any encoding schemes that can recover from random noise introduced during transmission? The answers to these questions were purely mathematical theorems, of course.