New covering array numbers

DOI10.1016/J.AMC.2019.01.069MaRDI QIDQ2010732zbMATH OpenOpenAlexFDO

Authors Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez

Publication date 27 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.10040

zbMATH Keywords

covering array numberjuxtaposition of covering arraysnon-isomorphic covering arrays

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Orthogonal arrays, Latin squares, Room squares (05B15)

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.

Recommendations

• Covering arrays via set covers
• Covering arrays from cyclotomy
• New primitive covering numbers and their properties
• scientific article; zbMATH DE number 5177325
• On covering numbers
• Tower of covering arrays
• Covering arrays, augmentation, and quilting arrays
• scientific article; zbMATH DE number 4004204
• On perfect sequence covering arrays
• Recursive constructions of covering arrays

Cites work

• A survey of binary covering arrays
• Constraint models for the covering test problem
• Covering and radius-covering arrays: constructions and classification
• Covering arrays of strength three
• Families of \(k\)-independent sets
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• New optimal covering arrays using an orderly algorithm
• Orthogonal Arrays of Index Unity
• Orthogonal arrays. Theory and applications
• Structures and lower bounds for binary covering arrays
• Tower of covering arrays
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(8)

• Problems and algorithms for covering arrays via set covers
• New optimal covering arrays using an orderly algorithm
• Covering arrays of strength 3 and 4 from holey difference matrices
• Construction of non-isomorphic covering arrays
• Covering arrays, augmentation, and quilting arrays
• Covering array EXtender
• Recursive constructions of covering arrays
• Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods

This page was built for publication: New covering array numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010732)