cfry@watdcsu.waterloo.edu (C.Fry - Inst. Computer Research) (02/10/89)
ICR presents a colloquium on
Good Codes From Algebraic Geometry
by
Prof. J.H. van Lint
of
Department of Mathematics and Computing Science
Eindhoven University of Technology
currently at
Alfred P. Sloan Laboratory of Mathematics and Physics
California Institute of Technology
Abstract
The talk starts with a brief introduction to coding theory and
more in particular Reed-Solomon codes. The necessary terminology
from algebraic geometry is introduced and the main tool: the
Riemann-Roch theorem is explained. The geometric Goppa codes
turn out to be a straightforward generalization of the Reed-
Solomon codes and their parameters are obtained from the
Riemann-Roch theorem. The surprising fact (1982) is that some of
these codes improve the so-called Gilbert bound, something which
many coding theorists had believed to be impossible.
(The talk contains all the necessary background material and is
intended to be understandable to a general audience.)
DATE: Wednesday, February 15, 1989
TIME: 3:30 p.m.
PLACE: DC 1302
Everyone is welcome. Refreshments served.