2000 character limit reached
New Covering Array Numbers
Published 27 Nov 2017 in cs.DM and math.CO | (1711.10040v2)
Abstract: A covering array CA(N; t; k; v) is an N x k array on v symbols such that every N x t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N; t; k; v) exists is called the covering array number of t, k, and v, and it is denoted by CAN(t; k; v). In this work we prove new CANs using an optimized procedure.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.