6 Citations (Scopus)

Abstract

An efficient conditional expectation algorithm for gencrating covering arrays has established a number of the best known upper bounds on covering array numbers. Despite its theoretical efficiency, the method requires a large amount of storage and time. In order to extend the range of its application, we generalize the method to find covering arrays that are invariant under the action of a group, reducing the search to consider only orbit representatives of interactions to be covered. at the same time, we extend the method to construct a generalization of covering arrays called quilting arrays. The extended conditional expectation algorithm, as expected, provides a technique for generating covering and quilting arrays that reduces the time and storage required. Remarkably, it also improves on the best known bounds on covering array numbers in a variety of parameter situations.

Original languageEnglish (US)
Pages (from-to)97-115
Number of pages19
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume90
StatePublished - 2014

Fingerprint

Covering Array
Conditional Expectation
Covering
Orbit
Upper bound
Generalise
Invariant
Interaction
Range of data

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

@article{e1ff4ca9cd074b699bc8eac7e9f693f1,
title = "Conditional expectation algorithms for covering arrays",
abstract = "An efficient conditional expectation algorithm for gencrating covering arrays has established a number of the best known upper bounds on covering array numbers. Despite its theoretical efficiency, the method requires a large amount of storage and time. In order to extend the range of its application, we generalize the method to find covering arrays that are invariant under the action of a group, reducing the search to consider only orbit representatives of interactions to be covered. at the same time, we extend the method to construct a generalization of covering arrays called quilting arrays. The extended conditional expectation algorithm, as expected, provides a technique for generating covering and quilting arrays that reduces the time and storage required. Remarkably, it also improves on the best known bounds on covering array numbers in a variety of parameter situations.",
author = "Charles Colbourn",
year = "2014",
language = "English (US)",
volume = "90",
pages = "97--115",
journal = "Journal of Combinatorial Mathematics and Combinatorial Computing",
issn = "0835-3026",
publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Conditional expectation algorithms for covering arrays

AU - Colbourn, Charles

PY - 2014

Y1 - 2014

N2 - An efficient conditional expectation algorithm for gencrating covering arrays has established a number of the best known upper bounds on covering array numbers. Despite its theoretical efficiency, the method requires a large amount of storage and time. In order to extend the range of its application, we generalize the method to find covering arrays that are invariant under the action of a group, reducing the search to consider only orbit representatives of interactions to be covered. at the same time, we extend the method to construct a generalization of covering arrays called quilting arrays. The extended conditional expectation algorithm, as expected, provides a technique for generating covering and quilting arrays that reduces the time and storage required. Remarkably, it also improves on the best known bounds on covering array numbers in a variety of parameter situations.

AB - An efficient conditional expectation algorithm for gencrating covering arrays has established a number of the best known upper bounds on covering array numbers. Despite its theoretical efficiency, the method requires a large amount of storage and time. In order to extend the range of its application, we generalize the method to find covering arrays that are invariant under the action of a group, reducing the search to consider only orbit representatives of interactions to be covered. at the same time, we extend the method to construct a generalization of covering arrays called quilting arrays. The extended conditional expectation algorithm, as expected, provides a technique for generating covering and quilting arrays that reduces the time and storage required. Remarkably, it also improves on the best known bounds on covering array numbers in a variety of parameter situations.

UR - http://www.scopus.com/inward/record.url?scp=84906237854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906237854&partnerID=8YFLogxK

M3 - Article

VL - 90

SP - 97

EP - 115

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

SN - 0835-3026

ER -