From fa784d619c1efffebeeed2ad62457330b4c14230 Mon Sep 17 00:00:00 2001 From: Thomas Schmitt Date: Mon, 7 May 2012 20:50:48 +0200 Subject: [PATCH] Corrected a wrong statement about CRC of empty input --- doc/boot_sectors.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/boot_sectors.txt b/doc/boot_sectors.txt index a092447..ae01faf 100644 --- a/doc/boot_sectors.txt +++ b/doc/boot_sectors.txt @@ -521,7 +521,7 @@ Byte Range | Value | Meaning (little endian numbers, LBA unit is 512 byte) The CRC-32 algorithm can be characterized as follows: The generating polynomial has the bit representation 0x104c11db7. The seed value for a bit shifting division algorithm is 0x46af6449. It is -chosen so that the CRC of 0 bytes of input is 0xffffffff. +chosen so that the CRC of 0 bytes of input is 0x00000000. The least significant bits of input bytes get processed first. I.e. bit0 of the last input byte gets mapped to x exp (7 + 32), bit7 of this byte gets mapped to x exp (0 + 32).