From d71dc66fa8a153fb6e7c626847095d9697a6cf42 Mon Sep 17 00:00:00 2001 From: Mark Adler Date: Tue, 9 Jul 2019 08:55:13 -0700 Subject: Fix error in comment on the polynomial representation of a byte. --- crc32.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'crc32.c') diff --git a/crc32.c b/crc32.c index 7503972..62cb9fe 100644 --- a/crc32.c +++ b/crc32.c @@ -224,7 +224,7 @@ local once_t made = ONCE_INIT; is just exclusive-or, and multiplying a polynomial by x is a right shift by one. If we call the above polynomial p, and represent a byte as the polynomial q, also with the lowest power in the most significant bit (so the - byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p, + byte 0xb1 is the polynomial x^7+x^3+x^2+1), then the CRC is (q*x^32) mod p, where a mod b means the remainder after dividing a by b. This calculation is done using the shift-register method of multiplying and -- cgit v1.2.3-55-g6feb