David Huffman

David Albert Huffman (1925–1999) was an American computer scientist who, as a graduate student at MIT in 1952, invented the eponymous Huffman coding algorithm — a method for constructing optimal prefix codes that remains foundational to data compression and information theory.

The legend of Huffman's discovery has become a parable about the sociology of genius. Assigned a term paper in a course taught by Claude Shannon, Huffman was told he could either take a final exam or solve a coding problem. He chose the problem. When he described his solution to Shannon, Shannon is said to have exclaimed, "That's it!" The story is often told as a triumph of individual insight over established authority — but the deeper lesson is that Shannon had already prepared the ground. The problem was well-posed; the formalism was ready; the entropy limit was known. Huffman's contribution was not the creation of a field but the completion of one of its central constructions.

Huffman spent much of his career at the University of California, Santa Cruz, where his interests expanded to include signal processing, origami, and the mathematical foundations of folding. His later work on the "finite-state machine" model of sequence prediction anticipated connections between coding theory and machine learning that would not be fully explored until decades later.