Elwyn Berlekamp | |
---|---|
Born | Elwyn Ralph Berlekamp September 6, 1940 Dover, Ohio, U.S. |
Died | April 9, 2019 Piedmont, California, U.S. | (aged 78)
Alma mater | Massachusetts Institute of Technology |
Known for | Berlekamp's algorithm Berlekamp switching game Berlekamp–Welch algorithm Berlekamp–Massey algorithm Berlekamp–Rabin algorithm Berlekamp–Zassenhaus algorithm Berlekamp–Van Lint–Seidel graph Blockbusting Combinatorial game theory Cooling and heating Coupon Go Error-correcting codes with feedback Partisan game Phutball |
Awards | IEEE Richard W. Hamming Medal (1991) Claude E. Shannon Award (1993) |
Scientific career | |
Fields | Information theory, Coding theory, Combinatorial game theory |
Institutions | University of California, Berkeley |
Thesis | Block coding with noiseless feedback (1964) |
Doctoral advisor | Robert G. Gallager |
Doctoral students | Julia Kempe |
Other notable students | Ken Thompson |
Elwyn Ralph Berlekamp (September 6, 1940 – April 9, 2019) was a professor of mathematics and computer science at the University of California, Berkeley.[1][2] Berlekamp was widely known for his work in computer science, coding theory and combinatorial game theory.
Berlekamp invented an algorithm to factor polynomials and the Berlekamp switching game, and was one of the inventors of the Berlekamp–Welch algorithm and the Berlekamp–Massey algorithms, which are used to implement Reed–Solomon error correction. He also co-invented the Berlekamp–Rabin algorithm, Berlekamp–Zassenhaus algorithm, and the Berlekamp–Van Lint–Seidel graph.
Berlekamp had also been active in investing, and ran Axcom, which became the Renaissance Technologies' Medallion Fund.