Talk:CRC-32: Difference between revisions

Content added Content deleted

Inline

Revision as of 07:47, 30 November 2011

Task goal

Hi, What do you want the task to be about? --Paddy3118 17:45, 29 November 2011 (UTC)

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".--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 ITU-T Rec. V.42.) However, I am not author of this draft task. --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 ? --Spekkio 21:14, 29 November 2011 (UTC)

Hmm, ok I see. There are many types of algoritms that can be called a CRC. I think the most common CRC algoritm would be the IEEE 802.3 CRC-32. But it would also be interesting to make CRC-8,CRC-16 etc... --Spekkio 07:47, 30 November 2011 (UTC)

@@ Line 4: / Line 4: @@
 :: 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)
+Hmm, ok I see. There are many types of algoritms that can be called a CRC. I think the most common CRC algoritm would be the IEEE 802.3 CRC-32. But it would also be interesting to make CRC-8,CRC-16 etc... --[[User:Spekkio|Spekkio]] 07:47, 30 November 2011 (UTC)