Berlekamp Conference Announcement

There will be a two-day conference at MSRI in honor of Elwyn Berlekamp, as he nears his 60th birthday, on July 28 and 29 (Friday and Saturday), 2000.

This conference is organized by David Wolfe (Gustavus Adolphus College), Po Tong (Texas Instruments), Gadiel Seroussi (Hewlett-Packard Laboratories), Richard Guy (University of Calgary), and Sol Golomb (University of Southern California).

The Friday overlaps MSRI's Combinatorial Games Workshop (July 24-28) and so that day plays a dual role.

The Friday talks will relate, in one way or another, to Elwyn's work on combinatorial games. The Saturday talks will be related to coding theory.

FRIDAY, JULY 28

9:00 am Martin Mueller - Arrows: A Program that Plays Amazons

9:30 am Takenobu Takizawa- An Application of Mathematical Game Theory to Go Endgames -- Some Width-Two-Entrance Rooms with/without Kos --

10:00 am Break

10:30 am Sol Golomb- Hypercube Tic-Tac-Toe

11:30 Lunch

1:15 pm David Moews- The abstract structure of the group of games.

1:30 pm Jonathan Schaeffer- The Games Computers (and People) Play

2:30 pm Break

3:00 pm Bob Li- A game of switching network and a game of triangles.

5:30 pm Dinner at Women's Faculty Club (by invitation only)

SATURDAY, JULY 29

8:30 - 8:40 am Carpool meets in front of Evans Hall (there is no shuttle bus service on Saturdays)

9:00 am Robert McEliece - How Close to Maximum Likelihood is Iterative (Turbo) Decoding?

10:00 am Break

10:30 am Gadiel Seroussi - Elliptic curves / cryptology

11:30 am Lunch

1:00 pm Dilip Sarwate- Fast Implementations of Berlekamp's BCH Decoding Algorithm
1.35 pm Oscar Moreno- Exponential sums and improved minimum distance bounds for codes and improvements on the Chevalley-Warning and Ax-Katz results.

2:10 pm Break

2:20 pm Noam Elkies- The influences of algebraic geometry of curves over finite fields on coding theory.

FRIDAY, JULY 28
9:00 am	Martin Mueller - Arrows: A Program that Plays Amazons
9:30 am	Takenobu Takizawa- An Application of Mathematical Game Theory to Go Endgames -- Some Width-Two-Entrance Rooms with/without Kos --
10:00 am	Break
10:30 am	Sol Golomb- Hypercube Tic-Tac-Toe
11:30	Lunch
1:15 pm	David Moews- The abstract structure of the group of games.
1:30 pm	Jonathan Schaeffer- The Games Computers (and People) Play
2:30 pm	Break
3:00 pm	Bob Li- A game of switching network and a game of triangles.
5:30 pm	Dinner at Women's Faculty Club (by invitation only)
SATURDAY, JULY 29
8:30 - 8:40 am	Carpool meets in front of Evans Hall (there is no shuttle bus service on Saturdays)
9:00 am	Robert McEliece - How Close to Maximum Likelihood is Iterative (Turbo) Decoding?
10:00 am	Break
10:30 am	Gadiel Seroussi - Elliptic curves / cryptology
11:30 am	Lunch
1:00 pm	Dilip Sarwate- Fast Implementations of Berlekamp's BCH Decoding Algorithm
1.35 pm	Oscar Moreno- Exponential sums and improved minimum distance bounds for codes and improvements on the Chevalley-Warning and Ax-Katz results.
2:10 pm	Break
2:20 pm	Noam Elkies- The influences of algebraic geometry of curves over finite fields on coding theory.