David A. Huffman
| David A. Huffman | |
|---|---|
| Born | August 9, 1925 Ohio |
| Died | Script error: The function "death_date_and_age" does not exist. Santa Cruz, California |
| Residence | USA |
| Fields | Information theory, Coding theory |
| Alma mater | Ohio State University, Massachusetts Institute of Technology |
| Thesis | The Synthesis of Sequential Switching Circuits (1953) |
| Doctoral advisor | Samuel H. Caldwell |
| Known for | Huffman coding |
| Notable awards | IEEE Richard W. Hamming Medal (1999) |
David Albert Huffman (August 9, 1925 – October 7, 1999) was a pioneer in computer science, known for his Huffman coding.[1][2] He was also one of the pioneers in the field of mathematical origami.[3] David Huffman died at the age of 74, ten months after being diagnosed with cancer.
Education
Huffman earned in 1944 his bachelor's degree in electrical engineering from Ohio State University, then served two years as an officer in the United States Navy. He returned to Ohio State to earn in 1949 his master's degree in electrical engineering. In 1953, he collected his Doctor of Science in electrical engineering at the Massachusetts Institute of Technology (MIT), with the thesis The Synthesis of Sequential Switching Circuits, advised by Samuel H. Caldwell.[1][2][4]
Career
Huffman joined the faculty at MIT in 1953. In 1967, he joined the faculty of University of California, Santa Cruz and helped found its Computer Science Department, where he served as chair from 1970 to 1973. He retired in 1994.[2]
Awards and honors
- 1999: The IEEE Richard W. Hamming Medal.[5]
- 1998: A Golden Jubilee Award for Technological Innovation from the IEEE Information Theory Society, for "the invention of the Huffman minimum-length lossless data-compression code".[6]
- 1981: Charter recipient of the Computer Pioneer Award from the IEEE Computer Society.[7]
- 1973: The W. Wallace McDowell Award from the IEEE Computer Society.[8]
- 1955: The Louis E. Levy Medal from the Franklin Institute for his doctoral thesis on sequential switching circuits.[4][9]
References
- ↑ 1.0 1.1 Lua error in package.lua at line 80: module 'strict' not found.
- ↑ 2.0 2.1 2.2 Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ 4.0 4.1 David Albert Huffman at the Mathematics Genealogy Project
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
External links
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
Lua error in package.lua at line 80: module 'strict' not found.
