On Mon, 9 Nov 1998, Bryan Scaringe wrote:
a document called "Painless guide to Cyclic Redundancy
Checks" (or Check(ing), I can't recall). It should
"A PAINLESS GUIDE TO CRC ERROR DETECTION ALGORITHMS"
ftp://ftp.rocksoft.com/clients/rocksoft/papers/crc_v3.txt
Thanks!
--
| Tuukka Toivonen
On Sat, 7 Nov 1998, david wrote:
Can someone explain how to compute checksums and how do they work ?
Download GZIP and deflate compression specifications. They explain CRC
(32-bit if my memory serves) and sample implementation. It was very easy to
understand, even I did.
ftp://x2ftp.oulu.fi
Tuukka Toivonen wrote:
Download GZIP and deflate compression specifications. They explain CRC
(32-bit if my memory serves) and sample implementation. It was very easy to
understand, even I did.
I don't find it so easy ... :
Spending 5 minutes reading the crc code, all i understood
is that
Though you're original post mentioned checksums, the
thread that has developed seems to be discussing Cyclic
Redundancy Checks, which are quite different.
If you really want to understand CRC's, the only thing
which I have ever run across that explains them well was
a document called "Pai
James wrote:
-It depends entirely upon what sort of checksum you wish to compute.
how does the Mod 11 one work? i forgot, you associate weights with each
digit or something and add it all up and mod 11, but i get confused...
This sounds about right. I don't recall what the weights are,
Hello,
Can someone explain how to compute checksums and how do they work ?
This is for a program i'm working on (
http://www.imaginet.fr/~dramboz/jview) :
the program can create databases which are composed of blocks with the
same size. I'd like to add a checksum to each block to see
