Coding theorists | Numerical analysts

Richard Hamming

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 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 (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. (Wikipedia).

Richard Hamming
Video thumbnail

Richard II by William Shakespeare - Starring John Gielgud - 1960

The audio drama performed by The Shakespeare Recording Society. Sir John Gielgud Sir Michael Hordern Leo McKern Keith Michell and cast Copyright 1960 Caedmon, The Shakespeare Recording Society, Inc. Published by HarperCollinsAudioBooks

From playlist John Gielgud's Recordings

Video thumbnail

EXTRA BITS: More on Perfect Codes - Computerphile

This video is extra material from the 'Perfect Code' video: https://youtu.be/WPoQfKQlOjg http://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: http://bit.ly/nottscompute

From playlist Subtitled Films

Video thumbnail

Error Correction - Computerphile

What good is knowing you have a problem if you can't fix it? - Professor Brailsford explains Hamming Codes and how errors can not just be detected, but also corrected. Original Compression film: http://youtu.be/Lto-ajuqW3w Entropy in Compression: http://youtu.be/M5c_RFKVkko Error Detecti

From playlist Subtitled Films

Video thumbnail

TEDxCaltech - Leonard Susskind - Richard Feynman

Leonard Susskind is the Felix Bloch Professor of Physics at Stanford University.  His research interests include string theory, quantum field theory, quantum statistical mechanics, and quantum cosmology. He is a member of the National Academy of Sciences and the American Academy of Arts an

From playlist Quantum Mechanics Prof. Susskind & Feynman

Video thumbnail

Error correction | Journey into information theory | Computer Science | Khan Academy

How can we communicate in the presence of noise? Watch the next lesson: https://www.khanacademy.org/computing/computer-science/informationtheory/moderninfotheory/v/seti?utm_source=YT&utm_medium=Desc&utm_campaign=computerscience Missed the previous lesson? https://www.khanacademy.org/comp

From playlist Journey into information theory | Computer Science | Khan Academy

Video thumbnail

Two Teens, a Ham Radio, and Operation Deep Freeze

The eleven nations included in the Antarctic portion of the 1957-1958 International Geophysical Year created several permanent research stations, including the first permanent station at the South Pole. The effort to create a permanent scientific presence at, literally, the end of the eart

From playlist History of Science and Math

Video thumbnail

The Perfect Code - Computerphile

Summing up why Hamming's error correcting codes are regarded as 'Perfect' - Professor Brailsford explains. EXTRA BITS: https://youtu.be/i4zC67Yf5Iw For more background on this: https://youtu.be/1_X-7BgHbE0 http://www.facebook.com/computerphile https://twitter.com/computer_phile This

From playlist Subtitled Films

Video thumbnail

DEFCON 16: Deciphering Captcha

Speaker: Michael Brooks, Security Engineer, Fruition Security This presentation will detail two methods of breaking captcha. One uses RainbowCrack to break a visual captcha. The other uses fuzzy logic to break an audio captcha. Both methods are 100% effective. These are real attacks that

From playlist DEFCON 16

Video thumbnail

43: Hamming Error Correcting Code - Richard Buckland UNSW

Hamming codes, parity bits, magic. Detecting errors when transmitting information. Even better: correcting errors.

From playlist CS1: Higher Computing - Richard Buckland UNSW

Video thumbnail

Why Electronics Just Shouldn't Work

Every wire, memory chip, and radio link is constantly fending off data corruption with error detecting and correcting codes. With the help of these codes, electronics can keep up the illusion of perfection… most of the time. Hosted by: Stefan Chin SciShow has a spinoff podcast! It's call

From playlist Uploads

Video thumbnail

RubyConf 2014 - Going the Distance by Richard Schneeman

If you've ever misspelled a word while searching on Google, you've benefitted from decades of distance algorithm development. In this talk we'll break down some popular distance measurements and see how they can be implemented in Ruby. We'll look at real world applications with some live d

From playlist RubyConf 2014

Related pages

Hamming graph | George Boole | Hamming bound | Differential equation | Block code | Hamming distance | Characteristic equation (calculus) | Parity bit | Hamming code | Claude Shannon | Code word | Sphere packing | Green's function | Bit | John Tukey | Filter (signal processing) | Linear multistep method | Space (mathematics)