🚀 go-pugleaf

Kevin, also ask about check-difference (modulo 'eleven') as that catches
transposed 'digits' (and inserted single-null) etc....
CRC's are division-by-polynomial (fast in hardware: selective-exor-and-shift)
and polynomials are best chosen irreducible (to catch the longest sequences
of mis-bits, and so reduce the combinatorics of mis-bits in 'noisy' data) -Ray

Kevin Curry (curryk@cnwl.igs.net) wrote:
: Hello,

: 	All this time using computers and I never really asked. Hummm!!!!

: What is Checksum, Cyclic Redundancy Check and a MD5 Hash Function?

: (I'm aware that these functions are algorithms and polynomials of
: various descritpions which in turn are used to validate the integrity
: of files, modules, messages and so on. I've reviewed many of my
: manuals which speak of their use but don't explain any details. What
: are they really? What are the algorithms? How are are they applied?
: What are the differences and why are some more effective than others?)

: I thanks you in advance for your answer. Cheers!!!
: ttyl
: ---
: Kevin J. Curry - Maxville Ontario Canada.
: I DO NOT speak for my employeer - just me.
: Work: curryk@tc.gc.ca  Home: curryk@cnwl.igs.net
: PGP Public Key @KeyServers - KeyID 55AF3BE5
: or Finger Home address.


--
Cordially and sincerely yours, Mr. Raymond Kenneth Petry, CS
                  Principal Successor to Rev. Mary Baker Eddy
                      The Son Dey School of Christ Science
            		 http://www.serve.com/~lambhorn 
			     lambhorn@mail.serve.com