Elwyn R. Berlekamp

According to our database, Elwyn R. Berlekamp authored at least 43 papers between 1963 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Entrepreneurial Chess.

Elwyn R. Berlekamp, Richard M. Low

Int. J. Game Theory, 2018

2015

Algebraic Coding Theory - Revised Edition

Elwyn R. Berlekamp

WorldScientific, ISBN: 9789814635912, 2015

2009

The Galetron.

Elwyn R. Berlekamp

Games Econ. Behav., 2009

2006

Combinatorial Games.

Elwyn R. Berlekamp

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2002

Analysis of Composite Corridors.

Teigo Nakamura, Elwyn R. Berlekamp

Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

2000

The dots-and-boxes game - sophiticated child's play.

Elwyn R. Berlekamp

A K Peters, ISBN: 978-1-56881-129-1, 2000

1996

Bounded distance+1 soft-decision Reed-Solomon decoding.

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1996

1994

Mathematical Go - chilling gets the last point.

Elwyn R. Berlekamp, David Wolfe

AK Peters, ISBN: 978-1-56881-032-4, 1994

Mathematical Go endgames - nightmares for the professional Go player.

Elwyn R. Berlekamp, David Wolfe

A K Peters, ISBN: 978-0-923891-36-7, 1994

1988

Blockbusting and domineering.

Elwyn R. Berlekamp

J. Comb. Theory, Ser. A, 1988

1987

The application of error control to communications.

Elwyn R. Berlekamp, Robert E. Peile, Stephen P. Pope

IEEE Commun. Mag., 1987

1983

The construction of fast, high-rate, soft decision block decoders.

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1983

1982

Bit-serial Reed - Solomon encoders.

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1982

1978

Readable erasures improve the performance of Reed-Solomon codes (Corresp.).

Elwyn R. Berlekamp, John L. Ramsey

IEEE Trans. Inf. Theory, 1978

On the inherent intractability of certain coding problems (Corresp.).

Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg

IEEE Trans. Inf. Theory, 1978

1976

Cooperative bridge bidding (Corresp.).

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1976

1975

Algebraic codes for improving the reliability of tape storage.

Elwyn R. Berlekamp

Proceedings of the American Federation of Information Processing Societies: 1975 National Computer Conference, 1975

1974

The Hackenbush Number System for Compression of Numerical Data

Elwyn R. Berlekamp

Inf. Control., October, 1974

Some long cyclic linear binary codes are not so bad.

Elwyn R. Berlekamp, Jørn Justesen

IEEE Trans. Inf. Theory, 1974

1973

Extended double-error-correcting binary Goppa codes are cyclic (Corresp.).

Elwyn R. Berlekamp, Oscar Moreno

IEEE Trans. Inf. Theory, 1973

Goppa codes.

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1973

Review of 'Coding Theory' (van Lint, J. H.; 1971).

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1973

1972

Weight distributions of the cosets of the (32, 6) Reed-Muller code.

Elwyn R. Berlekamp, Lloyd R. Welch

IEEE Trans. Inf. Theory, 1972

Gleason's theorem on self-dual codes.

Elwyn R. Berlekamp, F. Jessie MacWilliams, Neil J. A. Sloane

IEEE Trans. Inf. Theory, 1972

Long primitive binary BCH codes have distance d ≤ 2n ln R^-1/log n ... .

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1972

Constructions for Balanced Howell Rotations for Bridge Tournaments.

Elwyn R. Berlekamp, Frank K. Hwang

J. Comb. Theory, Ser. A, 1972

1971

Coding Theory and the Mathieu Groups

Elwyn R. Berlekamp

Inf. Control., February, 1971

Factoring polynomials over large finite fields.

Elwyn R. Berlekamp

Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, 1971

1970

The Weight Enumerators for Certain Subcodes of the Second Order Binary Reed-Muller Codes

Elwyn R. Berlekamp

Inf. Control., December, 1970

Weight enumerator for second-order Reed-Muller codes.

Neil J. A. Sloane, Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1970

Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by hadamard smearing.

Elwyn R. Berlekamp

Bell Syst. Tech. J., 1970

1969

Restrictions on Weight Distribution of Reed-Muller Codes

Elwyn R. Berlekamp, Neil J. A. Sloane

Inf. Control., May, 1969

1968

Nonbinary BCH decoding (Abstr.).

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1968

Algebraic coding theory.

Elwyn R. Berlekamp

McGraw-Hill series in systems science, McGraw-Hill, ISBN: 0070049033, 1968

1967

On the Solution of Algebraic Equations over Finite Fields

Elwyn R. Berlekamp, H. Rumsey, Gustave Solomon

Inf. Control., June, 1967

Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II

Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp

Inf. Control., May, 1967

Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I

Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp

Inf. Control., January, 1967

A lower bound to the distribution of computation for sequential decoding.

Irwin M. Jacobs, Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1967

1965

On decoding binary Bose-Chadhuri- Hocquenghem codes.

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1965

1964

Block coding with noiseless feedback.

Elwyn R. Berlekamp

PhD thesis, 1964

Note on recurrent codes (Corresp.).

Elwyn R. Berlekamp

IEEE Trans. Inf. Theory, 1964

1963

A Class of Convolution Codes

Elwyn R. Berlekamp

Inf. Control., March, 1963

Program for Double-Dummy Bridge Problems--A New Strategy for Mechanical Game Playing.

Elwyn R. Berlekamp

J. ACM, 1963