From mjd@ece.orst.edu Wed Oct 21 13:46:16 1998
Return-Path: <mjd@ece.orst.edu>
Received: from ECE.ORST.EDU by cipher.ece.orst.edu (NX5.67g/NX3.0S)
	id AA02404; Wed, 21 Oct 98 13:45:48 -0700
Received: (from mjd@localhost)
	by ECE.ORST.EDU (8.9.1a/8.9.1) id NAA05520
	for islmail-outgoing; Wed, 21 Oct 1998 13:42:19 -0700 (PDT)
X-Authentication-Warning: ECE.ORST.EDU: mjd set sender to owner-islmail@ece.orst.edu using -f
Received: from cipher.ece.orst.edu (cipher.ECE.ORST.EDU [128.193.49.196])
	by ECE.ORST.EDU (8.9.1a/8.9.1) with SMTP id NAA05514
	for <islmail@ece.orst.edu>; Wed, 21 Oct 1998 13:42:18 -0700 (PDT)
Received: by cipher.ece.orst.edu (NX5.67g/NX3.0S)
	id AA02398; Wed, 21 Oct 98 13:45:45 -0700
Message-Id: <9810212045.AA02398@cipher.ece.orst.edu>
Content-Type: text/plain
Mime-Version: 1.0 (NeXT Mail 4.2mach v148)
Received: by NeXT.Mailer (1.148)
From: Cetin Kaya Koc <koc@cipher.ece.orst.edu>
Date: Wed, 21 Oct 98 13:45:44 -0700
To: islmail@ece.orst.edu
Subject: COURSE ANNOUNCEMENT FOR WINTER/SPRING 1999
X-Phone_&_Fax: 541 737 4853 -- 541 737 1300
X-Web_Address: http://www.ece.orst.edu/~koc
Sender: owner-islmail@ece.orst.edu
Precedence: bulk
Status: RO
X-Status: 


         COURSE ANNOUNCEMENT FOR WINTER/SPRING 1999

        Mth 441/541 (Winter 1999), 442/542 (Spring 1999)

        MWF 13:00: Applied and Computational Algebra

Mth 441/541:  Errors can occur when messages are transmitted. The theory
of algebraic coding develops and analyzes codes with good error detection
and correction properties.  Many superior codes use finite fields. In this
course the theory of finite fields will be carefully developed and applied
to error correcting codes. Topics covered will include: the construction and
classification of finite fields, deterministic and probabilistic methods
for factoring polynomials over finite fields, and BCH codes. Also, the
discrete Fourier transform, fast polynomial multiplication, and Reed-Solomon
codes will be covered as time permits.  There will be a computing component
for which Maple will be used but no previous experience with Maple is needed.
Prerequisite: Mth 342 or Mth 440 or permission of instructor.

Mth 442/542: The course will cover other topics in applied and computational
algebra with the interests of the participants in mind. Among these would
be a continuation of coding theory and polynomial factorization algorithms
from Mth 441 as needed. Possible additional topics include: Polya's theory
of counting; Pseudo-random number generation including the application to
one-way functions for cryptosystems; the discrete log problem; number
theoretical algorithms such as power detection mod p. Maple will be used
for the computing component of the course.

Text:  A Concrete Introduction to Higher Algebra (2nd Edition) by
L. Childs.

Instructor for Mth 441/541: Burt Fein

Instructor for Mth 442/542: Mary Flahive

For more information about these courses contact either instructor:

Burt Fein, Kidder 286, fein@math.orst.edu

Mary Flahive, Kidder 340, flahive@math.orst.edu