borisd
— Software Developer
Hamming Code visualisation
m - number of data bits.
p - number of parity check bits.
1. (p + m) - any of bits can be corrupted.
2. 1 - None of bits are corrupted.
Formula for a number of parity bits per data: 2^p >= p + m + 1
m = ⬅️ enter "m"
p = 1
Position of parity bits = 2^n (or 1, 2, 4, 8, 16, 32, 64, 128...).
ExampleInput Data: "" ⬅️ enter "data"
About the data: "1001000", data bits: 7, parity bits: 4, overall parity bits: 1
⬆️ change bits to affect decoding
Decoded data: H
Checks: Error position: 0; More than one error: false.
decoded data based only on your bits
Learn more on YouTube "But what are Hamming codes? The origin of error correction" by 3Blue1Brown