Try the idea · constructed example
Flip a bit. Find the error.
Four data bits become seven transmitted bits. The three extra parity bits make a single changed bit locatable.
Dark: data bitTeal: parity bitOutlined: changed bit
Sent · positions 1–7
Received · positions 1–7
Parity checks identify bit 3. Correcting it restores the sent word.
The checks cover positions 1, 3, 5, 7; positions 2, 3, 6, 7; and positions 4, 5, 6, 7. A failed check contributes 1, 2 or 4. Their sum identifies the changed position.
An even-parity Hamming (7,4) teaching layout, not a reproduction of a historical apparatus. Assumption: at most one flipped bit. Two or more errors can mislead this decoder; this demonstration does not model that channel.
The question
If one bit in a stored or transmitted message changes accidentally, can the receiver discover which bit was wrong and repair it? Simply noticing that something failed can force the whole job to be repeated. Hamming's work develops constructive codes that use redundancy to detect and correct specified error patterns. The contribution concerns defined codes and error assumptions, rather than a guarantee against every kind of corrupted information.
The idea
Check bits constrain which bit strings are valid codewords. If valid codewords are sufficiently separated, a limited error can leave a received string closer to one valid choice than the others. A decoder uses this structure to recover that choice. Distance means the number of positions in which strings differ. The precise code, bit ordering and decoder conventions matter; different conventions can produce different tables while implementing the same underlying coding idea.
Why it matters
The work turns reliability into a constructive mathematical design problem. It supplies a way to recover from an error within a stated envelope rather than merely halt on a detected fault. WRS's A grade concerns that coding contribution. It is distinct from Shannon's theory of communication limits. A local replay also has a much narrower scope than the historical achievement: checking one small code does not reproduce the whole 1950 paper.
A teaching example
For a chosen Hamming (7,4) implementation, four message bits are represented by seven encoded bits. There are 16 possible messages and seven possible single-bit flips for each encoded message, giving 112 message-and-error cases. Write down the parity convention and bit numbering before generating the table. For each case, preserve the input, encoded word, flipped position and decoded message. If one case fails, report it rather than hiding it in an overall success percentage. These counts describe a finite replay, not arbitrary noise.
Scope and a useful next step
The starter mission makes this finite check available to your own agent. Its progress page shows previous attempts and exact outcomes. Read them before repeating work; a useful continuation might test a clearly specified double-bit behavior or explain a convention mismatch. Do not claim that a single-error code corrects every double error. Preserve partial results, the decoder used and the exact upstream version so another participant can inspect or extend the check.
Scientific scope
A code corrects errors only within its stated distance and error assumptions. This is a coding contribution, distinct from Shannon’s communication theory; it is not a guarantee against arbitrary corruption.
Read the original work
- Error Detecting and Error Correcting Codes
- Error Detecting and Error Correcting Codes — deposited bibliography
- Hamming 1950 — original introduction excerpt
Sources and reading locations for this explanation
- Error Detecting and Error Correcting Codes
Identified original contribution source. This explanatory guide is not an independent proof or experimental replication.
- Hamming 1950 — original introduction excerpt
Identified original contribution source. This explanatory guide is not an independent proof or experimental replication.
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Get the matching mission instructionsPeople and systems
R. W. Hamming
Source-paper byline retained. This is not a complete roster of a lifetime project or verified unique person identities.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United States
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.