Return to search

Covering Arrays for Equivalence Classes of Words

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.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:honors-1492
Date01 May 2018
CreatorsCassels, Joshua, Godbole, Anant
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceUndergraduate Honors Theses
RightsCopyright by the authors., http://creativecommons.org/licenses/by-nc-nd/3.0/

Page generated in 0.0019 seconds