Adding strength 2 covering array methods #37371
Milestone
Comments
vbraun
pushed a commit
to vbraun/sage
that referenced
this issue
Aug 5, 2024
This patch aims to add functionality to the covering arrays module that was recently added to SageMath. It adds methods that create many covering arrays of strength 2 that can later be used for recursive constructions as well. Specifically: added methods to generate covering arrays and a main CA function to call them based on inputted parameters. Added methods include direct implementation of optimal arrays in the database of small combinatorial designs, methods that create a CA(N,t=2,k,v=2), for either k or N inputted and a recursive method that removes columns from a larger array. Added required documentation and reference for new methods. This fixes sagemath#37371 URL: sagemath#37372 Reported by: Aaron Dwyer Reviewer(s): Aaron Dwyer, Matthias Köppe, Sebastian Raaphorst
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Problem Description
Now that the basics of covering arrays are included in SageMath, some methods to generate covering arrays can be added.
This is a follow up to #34279
Proposed Solution
The number of known covering arrays with optimal size is relatively small, and all have strength t=2, so a good place to start is to implement all of them.
Alternatives Considered
Some strength 3 methods would be relatively simple to add as well.
Additional Information
No response
Is there an existing issue for this?
The text was updated successfully, but these errors were encountered: