What is Hamming Code?

Hamming Code is a set of error-correction codes that can be used to detect and correct single-bit errors that can occur when binary data is transmitted or stored. Developed by Richard Hamming in 1950, it works by adding redundant parity bits to the original data. This calculator allows you to input any binary sequence and see the exact steps taken to calculate the final codeword, including the placement of parity bits and the XOR operations involved.

How Hamming Code Calculation Works

The process follows a specific mathematical relationship where $2^P \ge M + P + 1$. Here, $M$ represents the number of data bits and $P$ represents the number of parity bits required. The parity bits are placed at positions that are powers of 2 (1, 2, 4, 8, etc.). Each parity bit covers specific data positions based on their binary representation. For example, parity bit $P1$ covers all positions where the least significant bit of the position index is 1 (1, 3, 5, 7...).

How to Use This Calculator

To use this Hamming Code generator, simply enter a string of 0s and 1s into the input field above. Click "Generate Hamming Code," and the tool will instantly calculate the required number of parity bits, identify their positions, and show you the final encoded word. The step-by-step breakdown explains which bits were used to calculate each parity bit (Even Parity is used by default).

Frequently Asked Questions

What is the Hamming (7,4) code?

The (7,4) Hamming code is a specific version that encodes four bits of data into seven bits by adding three parity bits. It is widely used in telecommunications and computer memory (ECC RAM).

Can Hamming Code correct multiple bits?

Standard Hamming code is designed for Single Error Correction (SEC). However, with an additional parity bit (often called SECDED), it can detect double-bit errors, though it can still only correct one.