Honors Program

Midway Honors

Date of Award


Thesis Professor(s)

Dr. Anant Godbole

Thesis Professor Department

Mathematics and Statistics

Thesis Reader(s)

Dr. Robert Beeler, Dr. Mark Giroux


Covering arrays for words of length t over a d letter alphabet are k × n arrays with entries from the alphabet so that for each choice of t columns, each of the dt t-letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered to be different. In the first case, words are equivalent if they induce the same partition of a t element set. In the second case, words of the same weighted sum are equivalent. In both cases we produce logarithmic upper bounds on the minimum size k = k(n) of a covering array. Most definitive results are for t = 2, 3, 4.


East Tennessee State University

Document Type

Honors Thesis - Open Access

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.


Copyright by the authors.