(algorithm)
Definition: A hash function that uses the first p bits of the key times an irrational number.
Formal Definition: h(k) = 
m(k A (mod 1))
, where m is usually an integer 2p and A is an irrational number (or an approximation thereto) 0 < A < 1. The modulo 1 operation removes the integer part of k × A.
Author: PEB
explanation, example, and guide to choosing A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:05 2006.
Cite this as:
Paul E. Black, "multiplication method", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/multplctnmth.html
