Hamming Code Playground
How can a message repair itself? Hamming(7,4) protects four data bits with three parity bits placed at positions 1, 2 and 4, arranged so that every possible single-bit error produces a unique pattern of parity failures — a syndrome that literally spells out the position of the flipped bit in binary. Set your own data bits, click any transmitted bit to corrupt it, and watch the decoder compute the syndrome, locate the error and flip it back.
Runs 100% in your browser — simulations are computed locally on your device.
Read the full guide to this tool
Notes
- Parity bit at position 2ᵏ checks every position whose binary index has bit k set.
- The three parity checks fail in exactly the pattern that spells the error position in binary.
- Hamming(7,4) corrects any single-bit error; add one more parity bit and it also detects double errors.
- Runs 100% in your browser — simulations are computed locally on your device.
Related tools
Dynamic Programming Visualizer
Watch edit distance and knapsack fill their tables cell by cell — dynamic programming with the lid off.
Graph Algorithm Playground
Build a graph by clicking, then watch BFS, DFS, Dijkstra and Prim explore it live.
Huffman Coding Visualizer
Type any text and watch the optimal prefix code assemble itself as a tree, rare letters sinking deepest.
Pathfinding Visualizer
Draw walls and watch A*, Dijkstra, greedy and breadth-first search hunt for the shortest path.
Sorting Algorithm Visualizer
Watch bubble, insertion, merge, quick and heap sort race through the same shuffled bars.
Turing Machine Simulator
Watch a Turing machine read, write and shuffle along its tape — computation stripped to its atoms.