Richard Wesley Hamming (February 11, 1915 – January 7, 1998) was an American mathematician whose work had many implications for computer engineering and telecommunications. His contributions include the Hamming code (which makes use of a Hamming matrix), the Hamming window, Hamming numbers, sphere-packing (or Hamming bound), Hamming graph concepts, and the Hamming distance.
|Born||February 11, 1915|
Chicago, Illinois, U.S.
|Died||January 7, 1998 82) (aged|
Monterey, California, U.S.
|Alma mater||University of Chicago (B.S. 1937)|
University of Nebraska (M.A. 1939)
University of Illinois at Urbana–Champaign (Ph.D. 1942)
|Awards||Turing Award (1968)|
IEEE Emanuel R. Piore Award (1979)
Harold Pender Award (1981)
IEEE Hamming Medal (1988)
|Thesis||Some Problems in the Boundary Value Theory of Linear Differential Equations (1942)|
|Doctoral advisor||Waldemar Trjitzinsky|
|Influenced||David J. Farber|
Born in Chicago, Hamming attended University of Chicago, University of Nebraska and the University of Illinois at Urbana–Champaign, where he wrote his doctoral thesis in mathematics under the supervision of Waldemar Trjitzinsky (1901–1973). In April 1945 he joined the Manhattan Project at the Los Alamos Laboratory, where he programmed the IBM calculating machines that computed the solution to equations provided by the project's physicists. He left to join the Bell Telephone Laboratories in 1946. Over the next fifteen years he was involved in nearly all of the Laboratories' most prominent achievements. For his work he received the Turing Award in 1968, being its third recipient.
After retiring from the Bell Labs in 1976, Hamming took a position at the Naval Postgraduate School in Monterey, California, where he worked as an adjunct professor and senior lecturer in computer science, and devoted himself to teaching and writing books. He delivered his last lecture in December 1997, just a few weeks before he died from a heart attack on January 7, 1998.