__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2011 Claremont Center for the Mathematical Sciences

When

Start: 09/07/2016 - 4:15pm

End : 09/07/2016 - 5:15pm

End : 09/07/2016 - 5:15pm

Category

Colloquium

Speaker

Nathan Kaplan (UCI)

Abstract

We give an introduction to error-correcting codes focusing on connections to combinatorics, linear algebra, and geometry. No previous familiarity with coding theory will be assumed.

A code C is a subset of (F_q)^n, where F_q denotes the finite field of q elements. The Hamming distance between two elements of (F_q)^n is the number of coordinates in which they are different. For fixed q and n what is the maximum size of a code such that any two of its elements have Hamming distance at least d? This problem is easy to state but leads to surprisingly complicated mathematics. We will focus on one extremal family, the Maximum Distance Separable (MDS) codes. Understanding these codes (when they exist, how many there are, etc.) is a major problem in coding theory that has natural connections to classical algebraic geometry.

Where

Kravis Center Lower Court 62, Claremont McKenna College