Elwyn Berlekamp

Elwyn Berlekamp

Infobox Scientist
name = Elwyn R Berlekamp


|185px
image_width = 125px
birth_date = Birth date and age|1940|9|6
death_date =
residence = USA
alma_mater = MIT
field = Information theory, Coding theory, Combinatorial game theory
known_for = Berlekamp-Massey algorithm

Elwyn Ralph Berlekamp (born September 6, 1940 in Dover, Ohio, United States of America) is a professor emeritus of mathematics and EECS at the University of California, Berkeley. He is known for his work in information theory and combinatorial game theory.Contributors, "IEEE Transactions on Information Theory" 42, #3 (May 1996), p. 1048. DOI [http://dx.doi.org/10.1109/TIT.1996.490574 10.1109/TIT.1996.490574] .]

While an undergraduate at MIT, he was a Putnam Fellow in 1961. He completed his Bachelor's and Master's degrees in electrical engineering in 1962. Continuing his studies at MIT, he finished his Ph.D. in electrical engineering in 1964; his advisors were Claude Shannon, Robert G. Gallager, Peter Elias and John Wozencraft. Berlekamp taught at the University of California, Berkeley from 1964 until 1966, when he became a researcher at Bell Labs. In 1971, Berlekamp returned to Berkeley, where, as of 2008, he is a Professor of the Graduate School. [http://math.berkeley.edu/index.php?module=mathfacultyman&MATHFACULTY_MAN_op=sView&MATHFACULTY_id=111 Elwyn Berlekamp] , listing at the Department of Mathematics, University of California, Berkeley.] [http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=22678 Contributors] , "IEEE Transactions on Information Theory" 20, #3 (May 1974), p. 408.] As of 2008, he is the only member of the mathematics faculty who does not possess a degree in mathematics.

Berlekamp is one of the inventors of the Welch-Berlekamp and Berlekamp-Massey algorithms, which are used to implement Reed-Solomon error correction. In the mid-1980s, he was president of Cyclotomics, Inc., a corporation which developed error-correcting code technology. With John Horton Conway and Richard K. Guy, he co-authored "Winning Ways for your Mathematical Plays", leading to his recognition as one of the founders of combinatorial game theory. He has studied various games, including Fox and Geese and other fox games, dots and boxes, and, especially, Go. With David Wolfe, Berlekamp co-authored the book "Mathematical Go", which describes methods for analyzing certain classes of Go endgames.

Outside of mathematics and computer science, Berlekamp has also experienced tremendous success in money management. In 1986, on behalf of Axcom Trading Advisors, a futures trading company, Berlekamp began information-theoretic studies of commodity and financial futures. In 1989, Berlekamp purchased a majority interest in Axcom. After the firm's futures trading algorithms were rewritten, Axcom's flagship fund had a return (in 1990) of 55%, net of all management fees and transaction costs. Today, this fund is known as the Medallion Fund and is managed by James Harris Simons and his Renaissance Technologies Corporation. [ [http://math.berkeley.edu/~berlek/fineng.html Financial Engineering] , Elwyn Berlekamp's Home Page. Accessed on line October 30, 2007.]

Berlekamp and his wife Jennifer have two daughters and a son and live in Piedmont, California.

Selected publications

* "Block coding with noiseless feedback". Thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1964.
* "Algebraic Coding Theory", New York: McGraw-Hill, 1968. Revised ed., Aegean Park Press, 1984, ISBN 0894120638.
* (with John Horton Conway and Richard K. Guy) "Winning Ways for your Mathematical Plays".:*1st edition, New York: Academic Press, 2 vols., 1982; vol. 1, hardback: ISBN 0-12-091150-7, paperback: ISBN 0-12-091101-9; vol. 2, hardback: ISBN 0-12-091152-3, paperback: ISBN 0-12-091102-7. :*2nd edition, Wellesley, Massachusetts: A. K. Peters Ltd., 4 vols., 2001–2004; vol. 1: ISBN 1-56881-130-6; vol. 2: ISBN 1-56881-142-X; vol. 3: ISBN 1-56881-143-8; vol. 4: ISBN 1-56881-144-6.
* (with David Wolfe) "Mathematical Go". Wellesley, Massachusetts: A. K. Peters Ltd., 1994. ISBN 1-56881-032-6.
* "The Dots-and-Boxes Game". Natick, Massachusetts: A. K. Peters Ltd., 2000. ISBN 1-56881-129-2.

ee also

* Berlekamp's algorithm

References

External links

* [http://math.berkeley.edu/~berlek/ Elwyn Berlekamp] home page at the University of California, Berkeley.
*MathGenealogy |id=31359.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Elwyn Berlekamp — Elwyn Ralph Berlekamp Naissance 6 septembre 1940 Dover (Ohio) (en …   Wikipédia en Français

  • Elwyn Berlekamp — Elwyn Ralph Berlekamp (* 6. September 1940 in Dover (Ohio)) ist ein US amerikanischer Mathematiker und Informatiker, der sich insbesondere mit Kodierungstheorie und kombinatorischer Spieltheorie beschäftigt. Berlekamp in Banff 2005 Berlekamp… …   Deutsch Wikipedia

  • Berlekamp's algorithm — In mathematics, particularly computational algebra, Berlekamp s algorithm is a well known method for factoring polynomials over finite fields (also known as Galois fields ). The algorithm consists mainly of matrix reduction and polynomial GCD… …   Wikipedia

  • Berlekamp-Algorithmus — In der Computeralgebra, einem Teilgebiet der Mathematik, ist der Berlekamp Algorithmus eine Methode zur Faktorisierung von Polynomen über einem endlichen Körper, die 1967 von Elwyn Berlekamp entwickelt wurde. Er ist in den meisten… …   Deutsch Wikipedia

  • Berlekamp-Massey-Algorithmus — Der Berlekamp Massey Algorithmus (nach Elwyn Berlekamp und James Massey) dient dazu, das kürzeste, lineare rückgekoppelte Schieberegister zu finden, das eine gegebene Folge von Symbolen ausgibt. Die Symbole können aus einem beliebigen Körper… …   Deutsch Wikipedia

  • Berlekamp–Massey algorithm — The Berlekamp–Massey algorithm is an algorithm for finding the shortest linear feedback shift register (LFSR) for a given output sequence. Equivalently, it is an algorithm for finding the minimal polynomial of a linearly recurrent sequence.The… …   Wikipedia

  • Algorithme De Berlekamp — L algorithme de Berlekamp est une méthode de factorisation des polynômes à coefficients dans un corps fini, qui repose sur des calculs de PGCD de polynômes et des opérations matricielles. Il a été découvert par Elwyn Berlekamp en 1967, et est… …   Wikipédia en Français

  • Algorithme de berlekamp — L algorithme de Berlekamp est une méthode de factorisation des polynômes à coefficients dans un corps fini, qui repose sur des calculs de PGCD de polynômes et des opérations matricielles. Il a été découvert par Elwyn Berlekamp en 1967, et est… …   Wikipédia en Français

  • Algorithme de Berlekamp — L algorithme de Berlekamp est une méthode de factorisation des polynômes à coefficients dans un corps fini, qui repose sur des calculs de PGCD de polynômes et des opérations matricielles. Il a été découvert par Elwyn Berlekamp en 1967, et est… …   Wikipédia en Français

  • Claude Shannon — Claude Elwood Shannon (1916 2001) Born April …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”