Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElwyn R. Berlekamp
Person information
- award (1991): IEEE Richard W. Hamming Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b6]Elwyn R. Berlekamp:
Algebraic Coding Theory - Revised Edition. WorldScientific 2015, ISBN 9789814635899, pp. 1-500- 2000
- [b5]Elwyn R. Berlekamp:
The dots-and-boxes game - sophiticated child's play. A K Peters 2000, ISBN 978-1-56881-129-1, pp. I-XI, 1-131 - 1994
- [b4]Elwyn R. Berlekamp, David Wolfe:
Mathematical Go - chilling gets the last point. AK Peters 1994, ISBN 978-1-56881-032-4, pp. I-V, 1-234 - [b3]Elwyn R. Berlekamp, David Wolfe:
Mathematical Go endgames - nightmares for the professional Go player. A K Peters 1994, ISBN 978-0-923891-36-7, pp. I-XX, 1-234 - 1968
- [b2]Elwyn R. Berlekamp:
Algebraic coding theory. McGraw-Hill series in systems science, McGraw-Hill 1968, ISBN 0070049033, pp. I-XIV, 1-466 - 1964
- [b1]Elwyn R. Berlekamp:
Block coding with noiseless feedback. Massachusetts Institute of Technology, USA, 1964
Journal Articles
- 2018
- [j33]Elwyn R. Berlekamp, Richard M. Low:
Entrepreneurial Chess. Int. J. Game Theory 47(2): 379-415 (2018) - 2009
- [j32]Elwyn R. Berlekamp:
The Galetron. Games Econ. Behav. 66(2): 598 (2009) - 1996
- [j31]Elwyn R. Berlekamp:
Bounded distance+1 soft-decision Reed-Solomon decoding. IEEE Trans. Inf. Theory 42(3): 704-720 (1996) - 1988
- [j30]Elwyn R. Berlekamp:
Blockbusting and domineering. J. Comb. Theory, Ser. A 49(1): 67-116 (1988) - 1987
- [j29]Elwyn R. Berlekamp, Robert E. Peile, Stephen P. Pope:
The application of error control to communications. IEEE Commun. Mag. 25(4): 44-57 (1987) - 1983
- [j28]Elwyn R. Berlekamp:
The construction of fast, high-rate, soft decision block decoders. IEEE Trans. Inf. Theory 29(3): 372-377 (1983) - 1982
- [j27]Elwyn R. Berlekamp:
Bit-serial Reed - Solomon encoders. IEEE Trans. Inf. Theory 28(6): 869-874 (1982) - 1978
- [j26]Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg:
On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3): 384-386 (1978) - [j25]Elwyn R. Berlekamp, John L. Ramsey:
Readable erasures improve the performance of Reed-Solomon codes (Corresp.). IEEE Trans. Inf. Theory 24(5): 632-633 (1978) - 1976
- [j24]Elwyn R. Berlekamp:
Cooperative bridge bidding (Corresp.). IEEE Trans. Inf. Theory 22(6): 753-756 (1976) - 1974
- [j23]Elwyn R. Berlekamp:
The Hackenbush Number System for Compression of Numerical Data. Inf. Control. 26(2): 134-140 (1974) - [j22]Elwyn R. Berlekamp, Jørn Justesen:
Some long cyclic linear binary codes are not so bad. IEEE Trans. Inf. Theory 20(3): 351-356 (1974) - 1973
- [j21]Elwyn R. Berlekamp:
Review of 'Coding Theory' (van Lint, J. H.; 1971). IEEE Trans. Inf. Theory 19(1): 138 (1973) - [j20]Elwyn R. Berlekamp:
Goppa codes. IEEE Trans. Inf. Theory 19(5): 590-592 (1973) - [j19]Elwyn R. Berlekamp, Oscar Moreno:
Extended double-error-correcting binary Goppa codes are cyclic (Corresp.). IEEE Trans. Inf. Theory 19(6): 817-818 (1973) - 1972
- [j18]Elwyn R. Berlekamp, Frank K. Hwang:
Constructions for Balanced Howell Rotations for Bridge Tournaments. J. Comb. Theory, Ser. A 12(2): 159-166 (1972) - [j17]Elwyn R. Berlekamp, Lloyd R. Welch:
Weight distributions of the cosets of the (32, 6) Reed-Muller code. IEEE Trans. Inf. Theory 18(1): 203-207 (1972) - [j16]Elwyn R. Berlekamp, F. Jessie MacWilliams, Neil J. A. Sloane:
Gleason's theorem on self-dual codes. IEEE Trans. Inf. Theory 18(3): 409-414 (1972) - [j15]Elwyn R. Berlekamp:
Long primitive binary BCH codes have distance d ≤ 2n ln R-1/log n ... . IEEE Trans. Inf. Theory 18(3): 415-426 (1972) - 1971
- [j14]Elwyn R. Berlekamp:
Coding Theory and the Mathieu Groups. Inf. Control. 18(1): 40-64 (1971) - 1970
- [j13]Elwyn R. Berlekamp:
Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by hadamard smearing. Bell Syst. Tech. J. 49(6): 969-986 (1970) - [j12]Elwyn R. Berlekamp:
The Weight Enumerators for Certain Subcodes of the Second Order Binary Reed-Muller Codes. Inf. Control. 17(5): 485-500 (1970) - [j11]Neil J. A. Sloane, Elwyn R. Berlekamp:
Weight enumerator for second-order Reed-Muller codes. IEEE Trans. Inf. Theory 16(6): 745-751 (1970) - 1969
- [j10]Elwyn R. Berlekamp, Neil J. A. Sloane:
Restrictions on Weight Distribution of Reed-Muller Codes. Inf. Control. 14(5): 442-456 (1969) - 1968
- [j9]Elwyn R. Berlekamp:
Nonbinary BCH decoding (Abstr.). IEEE Trans. Inf. Theory 14(2): 242 (1968) - 1967
- [j8]Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp:
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I. Inf. Control. 10(1): 65-103 (1967) - [j7]Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp:
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II. Inf. Control. 10(5): 522-552 (1967) - [j6]Elwyn R. Berlekamp, H. Rumsey, Gustave Solomon:
On the Solution of Algebraic Equations over Finite Fields. Inf. Control. 10(6): 553-564 (1967) - [j5]Irwin M. Jacobs, Elwyn R. Berlekamp:
A lower bound to the distribution of computation for sequential decoding. IEEE Trans. Inf. Theory 13(2): 167-174 (1967) - 1965
- [j4]Elwyn R. Berlekamp:
On decoding binary Bose-Chadhuri- Hocquenghem codes. IEEE Trans. Inf. Theory 11(4): 577-579 (1965) - 1964
- [j3]Elwyn R. Berlekamp:
Note on recurrent codes (Corresp.). IEEE Trans. Inf. Theory 10(3): 257-258 (1964) - 1963
- [j2]Elwyn R. Berlekamp:
A Class of Convolution Codes. Inf. Control. 6(1): 1-13 (1963) - [j1]Elwyn R. Berlekamp:
Program for Double-Dummy Bridge Problems--A New Strategy for Mechanical Game Playing. J. ACM 10(3): 357-364 (1963)
Conference and Workshop Papers
- 2006
- [c4]Elwyn R. Berlekamp:
Combinatorial Games. ITW 2006: 350 - 2002
- [c3]Teigo Nakamura, Elwyn R. Berlekamp:
Analysis of Composite Corridors. Computers and Games 2002: 213-229 - 1975
- [c2]Elwyn R. Berlekamp:
Algebraic codes for improving the reliability of tape storage. AFIPS National Computer Conference 1975: 497-499 - 1971
- [c1]Elwyn R. Berlekamp:
Factoring polynomials over large finite fields. SYMSAC 1971: 223
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-19 19:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
