Hamming code
•
4 Jan 2009, 17:43
•
Journals
In need of an IT-student who could explain me how hamming code actually works. Hamming sucks cock if you ask me, floating point numbers +Binary Calculus = instawin + fun :)
Wikipedia makes it way too complicated...
Things I do understand so far:
-> Formula: g +r = n[/u] = memory word
with r -> g + r = 2^(r-1)-1
G = databits (3,5,7 and so on)
R = paritybits (correctionbits) = (x^2) 1,2,4,8,16,..
example:
parity 1= 1,3,5,7,9,..
parity 2 = 2-3,6-7,10-11,14-15,..
parity 4 = 4-5-6-7,12-13-14-15,20-21
and so on..
.svg/300px-Hamming(8,4).svg.png)
Wikipedia makes it way too complicated...
Things I do understand so far:
-> Formula: g +r = n[/u] = memory word
with r -> g + r = 2^(r-1)-1
G = databits (3,5,7 and so on)
R = paritybits (correctionbits) = (x^2) 1,2,4,8,16,..
example:
parity 1= 1,3,5,7,9,..
parity 2 = 2-3,6-7,10-11,14-15,..
parity 4 = 4-5-6-7,12-13-14-15,20-21
and so on..
btw 2ND
btw im gay
nerd²
parity 2 = 2-3,6-7,10-11,14-15,..
Its 2 so you take the 2nd digit also. Which is 3. You get pairs of 2 (2 & 3 is the pair).
To get the diffirence between the pairs use x + 1 (x = parity 2) so you get 3.
So if you take parity 4:
4-5-6-7, (4+1 = 5. Diffirence = 5) -> 7+5 = 12 (next starting digit is 12) 12-13-14-15 (15+5 = 20 (next starting digit is 20)), 20-21-22-23-24 and so on and so on...