Hamming code: Difference between revisions

Content deleted Content added
Removed reference to a badly written paper in a dubious journal, which seems to be out of place here.
Tag: references removed
Clarified example
Line 72:
# Each data bit is included in a unique set of 2 or more parity bits, as determined by the binary form of its bit position.
## Parity bit 1 covers all bit positions which have the '''least''' significant bit set: bit 1 (the parity bit itself), 3, 5, 7, 9, etc.
## Parity bit 2 covers all bit positions which have the '''second''' least significant bit set: bitbits 2 (the parity bit itself), -3, 6, -7, 10, -11, etc.
## Parity bit 4 covers all bit positions which have the '''third''' least significant bit set: bits 4–7, 12–15, 20–23, etc.
## Parity bit 8 covers all bit positions which have the '''fourth''' least significant bit set: bits 8–15, 24–31, 40–47, etc.