| |
| | Cyclic redundancy check - Wikipedia, the free encyclopedia |
 | | A cyclic redundancy check (CRC) is a type of hash function used to produce a checksum, which is a small number of bits, from a large block of data, such as a packet of network traffic or a block of a computer file, in order to detect errors in transmission or storage. |
 | | CRCs are often referred to as "checksums," but such designations are not strictly accurate since, technically, a checksum is calculated through addition, not division. |
 | | Alder-32 Note: D is the string of bytes for which the checksum is to be calculated, and n is the length of D. |
| en.wikipedia.org /wiki/Cyclic_redundancy_check (835 words) |
|