Graduation Year


Document Type

Open Access Senior Thesis

Degree Name

Bachelor of Science



Reader 1

Mohamed Omar

Reader 2

Michael Orrison

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Rights Information

2022 Benjamin R Langton


The recently proposed generalized covering radius is a fundamental property of error correcting codes. This quantity characterizes the trade off between time and space complexity of certain algorithms when a code is used in them. However, for the most part very little is known about the generalized covering radius. My thesis seeks to expand on this field in several ways. First, a new upper bound on this quantity is established and compared to previous bounds. Second, this bound is used to derive a new algorithm for finding codewords within the generalized covering radius of a given vector, and also to modify an existing algorithm, greatly improving its efficiency.