| David A. Huffman | |
| Birth Date: | 9 August 1925 |
| Birth Place: | Ohio |
| Death Place: | Santa Cruz, California |
| Alma Mater: | Ohio State University, Massachusetts Institute of Technology |
| Thesis Title: | The Synthesis of Sequential Switching Circuits |
| Thesis Year: | 1953 |
| Thesis Url: | http://dspace.mit.edu/handle/1721.1/4804 |
| Doctoral Advisor: | Samuel H. Caldwell |
| Field: | Information theory, Coding theory |
| Known For: | Huffman coding |
| Awards: | IEEE Richard W. Hamming Medal (1999) |
David Albert Huffman (August 9, 1925 – October 7, 1999) was an American 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]
Huffman earned his bachelor's degree in electrical engineering from Ohio State University in 1944. Then, he served two years as an officer in the United States Navy. He returned to Ohio State to earn his master's degree in electrical engineering in 1949. In 1953, he earned 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]
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]
Huffman is best known for Huffman coding, which he published while a ScD student at MIT in 1952. Huffman came up with the algorithm when a professor offered students to either take the traditional final exam, or improve a leading algorithm for data compression.[4] Huffman reportedly was more proud of his work "The Synthesis of Sequential Switching Circuits,"[1] which was the topic of his 1953 MIT thesis (an abridged version of which was published in the Journal of the Franklin Institute in 1954.[5])