Myself and my M.Sc. student Aaron Dwyer are interested in adding covering arrays to sagemath in the design theory code. We have been reviewing the orthogonal array code as guidance and have some questions for sage-combinat-devel community.
- We note that orthogonal arrays are not implemented as a class. Our initial thoughts were to implement covering arrays as as class. What do you all think about that? - Would it additionally be useful to re-implement orthogonal arrays as a child class of a covering arrays class and move the orthogonal array methods into that class? What would be the least disruptive way to do this? - We know that in sagemath development it is often a good idea to make small patches that are easy to review and edit. Would the right initial things to implement be the necessary class structure, documentation, self-checker (analogous to ```is_t_design``` in ```block_design```), formatted print and output to equivalent objects like a group divisible covering design? - One of our more substantive goals is to implement the perfect hash family and covering perfect hash family constructions. We are happy to hear what other people think would be important methods to implement for in a covering array class. brett stevens Aaron Dwyer -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-combinat-devel/8926605c-d908-4d97-bdd7-2bd9bb552040n%40googlegroups.com.
