skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Editors contains: "Holliday, Sarah"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Hoffman, Frederick; Holliday, Sarah; Rosen, Zvi; Shahrokhi, Farhad; Wierman, John (Ed.)
    For a finite field of order.q, and.v a divisor of.q − 1, additive translates of a cyclotomic vector yield a.q × q cyclotomic array on.v symbols. For every positive integer.t, for certain.q sufficiently large with respect to.v, such a cyclotomic array is always a covering array of strength.t. Asymptotically such arrays have far too many rows to be competitive with certain other covering array constructions. Nevertheless, for small values of .t , this cyclotomic method produces smallest known covering arrays for numerous parameters suitable for practical application. This paper extends these ideas and shows that cyclotomy can produce covering arrays of higher index, and locating and detecting arrays with large separation. Computational results also demonstrate that certain cyclotomic arrays for the same order.q but different values of .v can be juxtaposed to produce mixed-level covering, locating, and detecting arrays. 
    more » « less