Graduation Year
2022
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
Reader 1
Mohamed Omar
Reader 2
Michael Orrison
Terms of Use & License Information
Rights Information
2022 Benjamin R Langton
Abstract
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.
Recommended Citation
Langton, Benjamin, "Results on the Generalized Covering Radius of Error Correcting Codes" (2022). HMC Senior Theses. 265.
https://scholarship.claremont.edu/hmc_theses/265
