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
Ocean Beach, New York

... of age or older. The median age is 42 years. For every 100 females there are 126.2 males. For every 100 females age 18 and over, there are 120.4 males. The median income ...

 
 
 
This page was created in 30.7 ms