Elwyn Berlekamp | Academic Influence

Elwyn Berlekamp's AcademicInfluence.com Rankings

Elwyn Berlekamp

Mathematics

#163

World Rank

#389

Historical Rank

#72

USA Rank

Combinatorics

#23

World Rank

#27

Historical Rank

#5

USA Rank

Measure Theory

#873

World Rank

#1147

Historical Rank

#326

USA Rank

mathematics Degrees

Download Badge

Mathematics

Elwyn Berlekamp's Degrees

Bachelors Mathematics Princeton University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Elwyn Berlekamp Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Elwyn Ralph Berlekamp was a professor of mathematics and computer science at the University of California, Berkeley. Berlekamp was widely known for his work in computer science, coding theory and combinatorial game theory.

(See a Problem?)

Elwyn Berlekamp's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algebraic coding theory (1984) (2852)
Winning Ways for Your Mathematical Plays (1983) (1807)
On the inherent intractability of certain coding problems (Corresp.) (1978) (1414)
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II (1967) (387)
Factoring polynomials over large finite fields (1970) (353)
Bit-serial Reed - Solomon encoders (1982) (320)
Factoring polynomials over large finite fields* (1971) (295)
The technology of error-correcting codes (1980) (251)
Factoring polynomials over finite fields (1967) (196)
On the Solution of Algebraic Equations over Finite Fields (1967) (170)
A lower bound to the distribution of computation for sequential decoding (1967) (167)
Winning Ways for Your Mathematical Plays, Volume 2 (2003) (167)
The application of error control to communications (1987) (162)
Weight distributions of the cosets of the (32, 6) Reed-Muller code (1972) (155)
Bounded distance+1 soft-decision Reed-Solomon decoding (1996) (114)
Linear Codes with Covering Radius and Codimension (2001) (112)
Algebraic Coding Theory: Revised Edition (2015) (108)
Goppa codes (1973) (108)
Mathematical Go - chilling gets the last point (1994) (101)
Block coding with noiseless feedback (1964) (96)
A Construction for Partitions Which Avoid Long Arithmetic Progressions (1968) (94)
Negacyclic codes for the Lee metric (1966) (92)
Winning Ways for Your Mathematical Plays, Volume 4 (2004) (85)
Nonbinary BCH decoding (Abstr.) (1968) (84)
Key Papers in the Development of Coding Theory (1974) (67)
On decoding binary Bose-Chadhuri- Hocquenghem codes (1965) (65)
Some long cyclic linear binary codes are not so bad (1974) (54)
Blockbusting and domineering (1988) (49)
Weight enumerator for second-order Reed-Muller codes (1970) (48)
Combinatorial Games (2000) (45)
Extended double-error-correcting binary Goppa codes are cyclic (Corresp.) (1973) (44)
On Subsets with Intersections of Even Cardinality (1969) (43)
A strongly regular graph derived from the perfect ternary Golay code (1973) (42)
The enumeration of information symbols in BCH codes (1967) (40)
Gleason's theorem on self-dual codes (1972) (39)
The Economist's View of Combinatorial Games (1996) (38)
Coding Theory and the Mathieu Groups (1971) (36)
The dots-and-boxes game - sophiticated child's play (2000) (35)
Long primitive binary BCH codes have distance d ≤ 2n ln R-1/log n ... (1972) (33)
The Weight Enumerators for Certain Subcodes of the Second Order Binary Reed-Muller Codes (1970) (31)
Note on recurrent codes (Corresp.) (1964) (30)
The Hackenbush Number System for Compression of Numerical Data (1974) (28)
A Class of Convolution Codes (1963) (28)
Program for Double-Dummy Bridge Problems—A New Strategy for Mechanical Game Playing (1963) (26)
An analog to the discriminant over fields of characteristic two (1976) (26)
A Polygon Problem (1965) (25)
Constructions for Balanced Howell Rotations for Bridge Tournaments (1972) (24)
Pseudocyclic Maximum-Distance-Separable Codes (1990) (22)
The mathemagician and pied puzzler : a collection in tribute to Martin Gardner (1999) (19)
Non-binary BCH decoding (1966) (18)
The construction of fast, high-rate, soft decision block decoders (1983) (18)
Readable erasures improve the performance of Reed-Solomon codes (Corresp.) (1978) (18)
Sums of n 2 amazons (2000) (13)
Restrictions on Weight Distribution of Reed-Muller Codes (1969) (13)
The design of slowly shrinking labelled squares (1975) (12)
Distribution of cyclic matrices in a finite field (1966) (12)
Mathematical Go endgames - nightmares for the professional Go player (1994) (12)
Introductory overview of mathematical Go endgames (1991) (11)
Loopy games and computation (2005) (10)
An Application of Reed-Solomon Codes to a Satellite TDMA System (1986) (10)
An Improved Algorithm for Computing Logarithms over GP(p) and Its Cryptographic Significance (1978) (10)
Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by hadamard smearing (1970) (9)
Where Is the " Thousand-Dollar Ko ''? (1996) (8)
AVERAGE-CASE OPTIMIZED BUFFERED DECODERS. (1985) (8)
Precise coding with noiseless feedback (2002) (8)
A survey of algebraic coding theory (1970) (7)
Irregularities in the distributions of finite sequences (1970) (7)
Forcing Your Opponent to Stay in Control of a Loony Dot-and-Boxes Endgame (2002) (7)
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I (1967) (6)
Universal noiseless quantum computation: mathematical theory and applications (2001) (5)
Sol Golomb's 60th birthday symposiumUnimodular arrays (2000) (5)
The Performance of Block Codes (2002) (5)
Idempotents Among Partisan Games (2002) (4)
Review: Robert J. McEliece, The theory of information and coding: A mathematical framework for communication (1978) (4)
Analysis of Composite Corridors (2002) (4)
Applications of coding to spread spectrum communications (1983) (4)
Computer-assisted thermographic analysis of go endgames (2002) (4)
Correction to "The technology of error-correcting codes" (1981) (3)
A Survey of Coding Theory (1972) (3)
Sums of $N\times2$ Amazons (2000) (3)
Yellow-Brown Hackenbush (2009) (3)
Machine solution of no-trump double-dummy bridge problems (1962) (3)
Algebraic codes for improving the reliability of tape storage (1975) (3)
It s a Small (2018) (3)
Decoding the Golay Code (1972) (2)
CHAPTER 3 – A Strongly Regular Graph Derived from the Perfect Ternary Golay Code (1973) (2)
The Structure of Finite Fields (2015) (2)
Claude Elwood Shannon (1916–2001), Volume 49, Number 1 (2)
Small science: radical innovation. (2012) (2)
An Error-Control Code with an Imbalance of Ones and Zeros to Provide a Residual Carrier Component (1986) (2)
Hamming Codes, Single Error — Correcting and Cyclic (1970) (2)
Long Primitive Binary BCH Codes Have Distance d--2n In R/log n l (1972) (2)
Binary BCH Codes for Correcting Multiple Errors (2015) (2)
Cooperative bridge bidding (Corresp.) (1976) (2)
Introduction to Coding Theory (1970) (2)
Entrepreneurial Chess (2018) (1)
The distribution of matrices resulting from newton's identities in a field of characteristic two (1965) (1)
Error Correcting Codes for Digital Audio (1982) (1)
On Sets of Ternary Vectors Whose Only Linear Dependencies Involve an Odd Number of Vectors (1970) (1)
Report of the ARPA Study Group on Advanced Memory Concepts (1976) (1)
Fibonacci Plays Billiards (2020) (1)
On a Problem of Persi Diaconis (1994) (1)
The 4G4G4G4G4 Problems and Solutions (2002) (1)
Combinatorial Games Workshop 11w5073 (2011) (0)
The Information Rate of the Optimum Codes (2015) (0)
Data-punctuated token trees (1997) (0)
Entrepreneurial Chess (2017) (0)
Finding the Correct Number is Simplicity Itself (2018) (0)
Linearized Polynomials and Affine Polynomials (2015) (0)
Numbers, Nimbers and Numberless Wonders (2018) (0)
Wanna Bet? Math Geeks Have Made Millions by Knowing How to Improve Their Odds at Blackjack and the Stock Market@@@Bettor Math (2006) (0)
The Number of Irreducible q-ary Polynomials of Given Degree (2015) (0)
Cyclic Binary Codes (2015) (0)
Weight Enumerator Theorems (1970) (0)
The Heat of Battle (2018) (0)
Some Harder Games and How to Make Them Easier (2018) (0)
Taking and Breaking (2018) (0)
The Factorization of Polynomials over Finite Fields (2015) (0)
Arithmetic Operations Modulo an Irreducible Binary Polynomial (2015) (0)
Gorenstein-Zierler Generalized Nonbinary BCH Codes for the Hamming Metric (2015) (0)
The Affine Groups (1970) (0)
The Gilbert Bound (1970) (0)
An Algorithm for Solving the Key Equation over Any Field (1970) (0)
Definition of Binary Quadratic Residue Codes (1970) (0)
Codes Derived by Modifying or Combining Other Codes (2015) (0)
Review of 'Coding Theory' (van Lint, J. H.; 1971) (1973) (0)
Linear Cyclic Q — Ary Codes (1970) (0)
The Performance of Block Codes Elwyn Berlekamp (2001) (0)
Other Important Coding and Decoding Methods (2015) (0)
Polynomial Weights and Code Constructions (1973) (0)
Algebraic Decoding of BCH Codes (1970) (0)
NOTES ON SYSTEM THEORY. VOLUME VIII (1965) (0)
Basic Binary Codes (2015) (0)

This paper list is powered by the following services:

Other Resources About Elwyn Berlekamp

en.wikipedia.org

What Schools Are Affiliated With Elwyn Berlekamp?

Elwyn Berlekamp is affiliated with the following schools:

Image Attributions

Image Source for Elwyn Berlekamp