Benjamin Langton

Thesis Advisor: Dr. Mohamed Omar (Harvey Mudd College - Department of Mathematics)

Second Reader: Dr. Michael Orrison (Harvey Mudd College - Department of Mathematics)

Contact: blangton@hmc.edu

The Generalized Covering Radius of Linear Codes

The generalized covering radius is an extension of the concept of a covering radius of error correcting codes. Despite having many interesting properties that parallel those of the standard covering radius, very little is known about this quantity for most classes of codes. In my thesis I am hoping to explore upper and lower bounds on this for a variety of code classes and see if there exist algorithms for finding codewords within these bounds for arbitrary sets of input vectors. More coming soon!