I will be giving a 2-talk series on my recent research work to the Software Developers’ Association at ASU on February 9 and 14th, 7:30 PM, in CAVC351. I’ll update this if there are any changes to day/time/location. It will be about new work with Covering Arrays but mostly on the optimizations in designing the suite in C++.

# Category Archives: algorithms

# New Bounds for Covering Arrays of Strength 7

Happy Halloween!

I want to share some cool results of a project I’m working on in one of my classes. A *covering array* is a 4-tuple which is an array, each entry is from an alphabet of size , and for every of the columns, all -tuples over exists in at least one row when restricted to these columns. The *covering array number*, , is the smallest for which a exists. Kleitman and Spencer, and Katona independently, found for all ; no other cases are known for all , and only heuristics are known. My advisor keeps the best-known covering array numbers here.

I was able to show the following:

- ,
- ,
- ,
- ,
- ,
- .

The numbers in parentheses are the row reductions from previous known bounds. I won’t share how I did this yet, but it is a cool computational technique that works very well for high !