in reply to Re^2: Digest (checksum) Algorithm for 12 Decimal Digits?
in thread Digest (checksum) Algorithm for 12 Decimal Digits?

suppose you have a 3 bit hash function: the best is if all the value populate the 8 possibilities in equal density. now you remove 1 bit. it means that you have only 4 buckets now, and being the result of the union of two who are equal density, they are equal density.
IOW, if the hash function you used was good, the result is good.

Oha

  • Comment on Re^3: Digest (checksum) Algorithm for 12 Decimal Digits?

In Section Seekers of Perl Wisdom