New covering array numbers
From MaRDI portal
Publication:2010732
DOI10.1016/J.AMC.2019.01.069zbMATH Open1428.05043arXiv1711.10040OpenAlexW2963672988MaRDI QIDQ2010732FDOQ2010732
Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez
Publication date: 27 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1711.10040
Recommendations
- Covering arrays via set covers
- Covering arrays from cyclotomy
- New primitive covering numbers and their properties
- scientific article
- 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
- Orthogonal arrays. Theory and applications
- Orthogonal Arrays of Index Unity
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- A survey of binary covering arrays
- Covering and radius-covering arrays: constructions and classification
- Structures and lower bounds for binary covering arrays
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- Covering arrays of strength three
- Constraint models for the covering test problem
- Tower of covering arrays
- New optimal covering arrays using an orderly algorithm
Cited In (3)
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)
