Abstract

In this thesis we provide known and new results which explain the relationship between the actual minimum distance of cyclic codes, bounds that use only information on the defining sets of cyclic codes to lower bound the distance (root bounds) and bounds that also need the knowledge of the defining sets of all cyclic subcodes (border bounds). We propose a new bound which is provably better of many known bounds and that can be computed in polynomial time with respect to the length of the code. We sketch how to use the generalized Newton identities to give alternative proofs of known bounds. Finally, we use Groebner bases to prove that the optimal root bound can be computed in finite time.