Talk

[patric.o...@aalto.fi]

Hi,

Professor Brett Stevens, Carleton University, Canada, is visiting
my team this week and gives a talk on Friday at 13.15 in the
ELEC building (Otakaari 5), room D302. See the Abstract at the end
of this letter. Don't hesitate to forward this piece of information
to anyone that might be interested.

bw.

Patric Östergård
Professor

Dept. of Communications & Networking
Aalto University School of Electrical Engineering
P.O. Box 13000, 00076 Aalto, FINLAND
Tel: +358 50 344 3610
Fax: +358 9 470 22474
Email: patric.o...@aalto.fi

==============================================================================

Title: Uniformity in Covering Arrays

Abstract

A covering array with N rows, k columns (factors) with an alphabet of size v
is called uniform if in every column each symbol occurs either $\lfloor N/v
\rfloor$ or $\lceil N/v \rceil$ times. Many of the best known covering arrays
are uniform and all the ones known to be optimal are uniform. In her PhD
thesis, Karen Meagher asked, using graph homomorphism language, if all covering
arrays have a uniform partner with the same parameters. This is known to be
true for binary (v=2) covering arrays of strength t=2. We propose studing a
family of covering arrays of relatively small size to get better information
about covering array uniformity for v>2.

==============================================================================