Elwyn R. Berlekamp - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2015

Algebraic Coding Theory - Revised EditionElwyn R. Berlekamp. WorldScientific, 2015. [doi]

2009

The GaletronElwyn R. Berlekamp. geb, 66(2):598, 2009. [doi]

2006

Combinatorial GamesElwyn R. Berlekamp. itw 2006: 350 [doi]

2002

Analysis of Composite CorridorsTeigo Nakamura, Elwyn R. Berlekamp. CG 2003: 213-229 [doi]

2000

The dots-and-boxes game - sophiticated child s playElwyn R. Berlekamp. A K Peters, 2000.

1996

Bounded distance+1 soft-decision Reed-Solomon decodingElwyn R. Berlekamp. TIT, 42(3):704-720, 1996.

1994

Mathematical Go - chilling gets the last pointElwyn R. Berlekamp, David Wolfe. AK Peters, 1994.

Mathematical Go endgames - nightmares for the professional Go playerElwyn R. Berlekamp, David Wolfe. A K Peters, 1994.

1988

Blockbusting and domineeringElwyn R. Berlekamp. JCT, 49(1):67-116, 1988. [doi]

1987

The application of error control to communicationsElwyn R. Berlekamp, Robert E. Peile, Stephen P. Pope. cm, 25(4):44-57, 1987. [doi]

1983

The construction of fast, high-rate, soft decision block decodersElwyn R. Berlekamp. TIT, 29(3):372-377, 1983.

1982

Bit-serial Reed - Solomon encodersElwyn R. Berlekamp. TIT, 28(6):869-874, 1982.

1978

Readable erasures improve the performance of Reed-Solomon codes (Corresp.)Elwyn R. Berlekamp, John L. Ramsey. TIT, 24(5):632-633, 1978. [doi]

On the inherent intractability of certain coding problems (Corresp.)Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg. TIT, 24(3):384-386, 1978. [doi]

1976

Cooperative bridge bidding (Corresp.)Elwyn R. Berlekamp. TIT, 22(6):753-756, 1976. [doi]

1975

Algebraic codes for improving the reliability of tape storageElwyn R. Berlekamp. afips 1975: 497-499 [doi]

1974

The Hackenbush Number System for Compression of Numerical DataElwyn R. Berlekamp. iandc, 26(2):134-140, October 1974.

Some long cyclic linear binary codes are not so badElwyn R. Berlekamp, Jørn Justesen. TIT, 20(3):351-356, 1974. [doi]

1973

Goppa codesElwyn R. Berlekamp. TIT, 19(5):590-592, 1973. [doi]

Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)Elwyn R. Berlekamp, Oscar Moreno. TIT, 19(6):817-818, 1973. [doi]

Review of 'Coding Theory' (van Lint, J. H.; 1971)Elwyn R. Berlekamp. TIT, 19(1):138, 1973. [doi]

1972

Gleason's theorem on self-dual codesElwyn R. Berlekamp, F. Jessie MacWilliams, Neil J. A. Sloane. TIT, 18(3):409-414, 1972. [doi]

Weight distributions of the cosets of the (32, 6) Reed-Muller codeElwyn R. Berlekamp, Lloyd R. Welch. TIT, 18(1):203-207, 1972. [doi]

Constructions for Balanced Howell Rotations for Bridge TournamentsElwyn R. Berlekamp, Frank K. Hwang. JCT, 12(2):159-166, 1972.

-1/log n ... Elwyn R. Berlekamp. TIT, 18(3):415-426, 1972. [doi]

1971

Coding Theory and the Mathieu GroupsElwyn R. Berlekamp. iandc, 18(1):40-64, February 1971.

Factoring polynomials over large finite fieldsElwyn R. Berlekamp. symsac 1971: 223 [doi]

1970

The Weight Enumerators for Certain Subcodes of the Second Order Binary Reed-Muller CodesElwyn R. Berlekamp. iandc, 17(5):485-500, December 1970.

Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by hadamard smearingElwyn R. Berlekamp. bstj, 49(6):969-986, 1970. [doi]

Weight enumerator for second-order Reed-Muller codesNeil J. A. Sloane, Elwyn R. Berlekamp. TIT, 16(6):745-751, 1970. [doi]

1969

Restrictions on Weight Distribution of Reed-Muller CodesElwyn R. Berlekamp, N. J. A. Sloane. iandc, 14(5):442-456, May 1969.

1968

Algebraic coding theoryElwyn R. Berlekamp. McGraw-Hill series in systems science, McGraw-Hill, 1968. [doi]

Nonbinary BCH decoding (Abstr.)Elwyn R. Berlekamp. TIT, 14(2):242, 1968. [doi]

1967

On the Solution of Algebraic Equations over Finite FieldsElwyn R. Berlekamp, H. Rumsey, G. Solomon. iandc, 10(6):553-564, June 1967.

A lower bound to the distribution of computation for sequential decodingIrwin M. Jacobs, Elwyn R. Berlekamp. TIT, 13(2):167-174, 1967. [doi]

Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. IClaude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp. iandc, 10(1):65-103, January 1967.

Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. IIClaude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp. iandc, 10(5):522-552, May 1967.

1965

On decoding binary Bose-Chadhuri- Hocquenghem codesElwyn R. Berlekamp. TIT, 11(4):577-579, 1965. [doi]

1964

Block coding with noiseless feedbackElwyn R. Berlekamp. PhD thesis, Massachusetts Institute of Technology, USA, 1964. [doi]

Note on recurrent codes (Corresp.)Elwyn R. Berlekamp. TIT, 10(3):257-258, 1964. [doi]

1963

Program for Double-Dummy Bridge Problems--A New Strategy for Mechanical Game PlayingElwyn R. Berlekamp. JACM, 10(3):357-364, 1963. [doi]

A Class of Convolution CodesElwyn R. Berlekamp. iandc, 6(1):1-13, March 1963.

Sign in or sign up to see more results.

runs on WebDSL