Yann Guidon wrote:
and now, i'm back to my CRC algos :-)
See page 419 of Knuth (Vol 2) if you are using a simple CRC like say for a floppy disk. "polynomal aritmaitic is modulo b is identical to multiple-precison arithmetic with radix b except all the carries are suppresed. compare (1101)2 by (1011)2 binary with x^3+x^2+x+1 modulo 2: binary: ....1101 x...1011 -------- ....1101 ...1101 .1101 -------- 10001111 polynominal modulo 2: ....1101 x...1011 -------- ....1101 ...1101 .1101 -------- .1111111 "
YG
************************************************************* To unsubscribe, send an e-mail to majordomo@xxxxxxxx with unsubscribe f-cpu in the body. http://f-cpu.seul.org/
.
************************************************************* To unsubscribe, send an e-mail to majordomo@xxxxxxxx with unsubscribe f-cpu in the body. http://f-cpu.seul.org/