Encyclopedia > Pearson Hashing

Article Content

Pearson hashing

Redirected from Pearson Hashing

Pearson Hashing is a way of producing random numbers.

In 1990, Peter K. Pearson published a pseudo-random walk hash algorithm which produced integers from 0 to 255, using a combination of XOR and a 256-entry non-linear permutation table.

Pearson hashing can often be used with a specially selected non-linear permutation table to make a perfect hash function[?]: this combinations is known as perfect Pearson hashing.

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Grateful Dead

... death in 1973. Both Bill and Mickey played drums, and a wide variety of other percussion instruments. Following Pigpen's death, several people played keyboards. In 1973, ...