Elwyn R. Berlekamp

Professor Emeritus

Research Areas

• Games and Codes

Selected Publications

• E. R. Berlekamp, "Idempotents among partisan games," in More Games of No Chance, R. Nowakowski, Ed., Vol. 42, Cambridge, UK: Cambridge University Press, 2001, pp. 1-23.
• E. R. Berlekamp, "Sums of N x 2 Amazons," Institute of Mathematics Statistics Lecture Notes - Monograph Series, vol. 35, pp. 1-34, 2000.
• E. R. Berlekamp, "Bit-serial Reed-Solomon encoders," IEEE Trans. Information Theory, vol. 28, no. 6, pp. 869-874, Nov. 1982.
• E. R. Berlekamp, "Long primitive binary BHC codes have distance d - 2n lnR sup -1/log n," IEEE Trans. Information Theory, vol. IT-18, no. 3, pp. 415-426, May 1972.
• E. R. Berlekamp, "Block coding for the binary symmetric channel with noiseless, delayless feedback," in Error-Correcting Codes, H. B. Mann, Ed., New York, NY: John Wiley and Sons, Inc., 1968, pp. 61-88.