Timeline for What is a faster alternative to a CRC?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:01 | history | edited | CommunityBot |
Commonmark migration
|
|
| S Sep 2, 2016 at 0:36 | history | suggested | CommunityBot | CC BY-SA 3.0 |
change 216 to the correct value of 2 raised to the 16 power, i.e.: 2^16
|
| Sep 1, 2016 at 22:38 | review | Suggested edits | |||
| S Sep 2, 2016 at 0:36 | |||||
| Jul 27, 2011 at 17:10 | comment | added | Mark Booth | @greyfade - FigBug mentioned using 512 byte blocks, so this shouldn't be a problem for the OP. Good to have it noted for people with other requirements though. | |
| Jul 27, 2011 at 16:46 | comment | added | Billy ONeal | +1 -- a reasonable middle ground between a CRC and simple bit parity. | |
| Jul 27, 2011 at 16:13 | comment | added | greyfade | Do note that Adler32 is almost useless for short runs of data. Up to about 180 bytes, it produces numerous collisions. | |
| S Jul 27, 2011 at 16:09 | history | suggested | Mark Booth | CC BY-SA 3.0 |
Added a fuuller description from the wikipedia page
|
| Jul 27, 2011 at 16:03 | review | Suggested edits | |||
| S Jul 27, 2011 at 16:09 | |||||
| Jul 26, 2011 at 22:52 | history | answered | Gnawme | CC BY-SA 3.0 |