Anonymous user
Talk:CRC-32: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 3:
: The questions that come to my mind...Which polynominal? Is this in pursuit of a particular protocol's check? (i.e. ethernet frame checksums, ZIP file stream checksums, etc). "CRC" isn't any more specific than, say, "draw a shape".--[[User:Short Circuit|Michael Mol]] 18:02, 29 November 2011 (UTC)
:: I would like a task that calculates the ubiquitous CRC-32 as in RFC 1952 for GZIP. (The RFC contains an algorithm in C code, and refers to section 8.1.1.6.2 "32-bit frame check sequence" from [http://www.itu.int/rec/T-REC-V.42-200203-I/en ITU-T Rec. V.42].) However, I am not author of this draft task. --[[User:Kernigh|Kernigh]] 21:13, 29 November 2011 (UTC)
::Isn't it possible to write a program that calculates an N-bit CRC of a string with polynomial P ? --[[User:Spekkio|Spekkio]] 21:14, 29 November 2011 (UTC)▼
▲Isn't it possible to write a program that calculates an N-bit CRC of a string with polynomial P ?
| |||