Who designed something like the code http://en.wikipedia.org/wiki/Hamming_code ? According to this method?
90 90 90 90 90 90 90 90 90 90 90 90
90 74 12 90 90 F6 90 EB 12 90 90 69
90 90 90 90 90 90 90 90 90 90 90 90
90 90 90 90 90 90 90 90 90 90 90 90
00 E4 82 00 00 00 7B 82 00 00
F6 xor 69 xor EB = 74, and
E4 xor 7B xor EB = 74.
Richard Hamming did that because two-out-of-five did not do the job as well as he wanted it to. Hamming is the preferred method for RAM checks nowadays, even over parity.
Google Richard Hamming
Paul
Fast matrix transforms are integral to many computer applications. Here's a paper showing a fast SSE implementation:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.6754
Nice find, Mark, I missed that one. The PDF document is VERY in-depth.
Paul
I had problems with that link
I found it at the University of Kentucky...
https://www.ccs.uky.edu/~thorne/cs521_sm4/Docs/General/fulltext.pdf