Constructions of difference covering arrays.

DOI10.1016/J.JCTA.2003.09.005MaRDI QIDQ1421336zbMATH OpenOpenAlexFDO

Authors Jianxing Yin

Publication date 26 January 2004

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2003.09.005

zbMATH Keywords

combinatorial designs difference matrices

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Review text

A difference covering array with parameters \(k\), \(n\) and \(q\), or \(\text{DCA}( k,n;q)\) for short, over an abelian group \(G\) of order \(q\) is defined to be a \(k \times n\) array \((a_{ij})\) with entries \(a_{ij}\) (\(0 \leq i \leq k-1\), \(0 \leq j \leq n-1\)) from \(G\) such that, for any two distinct rows indexed \(t\) and \(h\), every element of \(G\) accurs in the corresponding list of differences \(\{a_{hj}-a_{tj} \mid j = 0,1,\ldots,n-1\}\) at least once. The paper describes a number of constructive techniques for DCAs. In particular, the author establishes the existence of a \(\text{DCA}(4,q+1;q)\) for every positive integer \(q\) with \(q \equiv 2 \pmod 4\).

Recommendations

Cites work

Cited in

(16)

Describes a project that uses

Uses Software

AETG

This page was built for publication: Constructions of difference covering arrays.

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