Covering arrays from cyclotomy

DOI10.1007/S10623-009-9333-8zbMath1215.05019OpenAlexW2057198333MaRDI QIDQ970532

Charles J. Colbourn

Publication date: 19 May 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9333-8

zbMATH Keywords

orthogonal arraycovering arraycyclotomic class\({\varepsilon}\)-biased array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (20)

A primer on the application of neural networks to covering array generation ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Covering arrays, augmentation, and quilting arrays ⋮ Covering arrays from \(m\)-sequences and character sums ⋮ Comparing balanced sequences obtained from ElGamal function to random balanced sequences ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Finite field constructions of combinatorial arrays ⋮ Algebraic Modelling of Covering Arrays ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Number of \(t\)-tuples in arrays from LFSRs ⋮ A two-stage algorithm for combinatorial testing ⋮ Randomized post-optimization of covering arrays ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Mixed-level covering, locating, and detecting arrays via cyclotomy ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ In-parameter-order strategies for covering perfect hash families ⋮ A survey on the problems and algorithms for covering arrays via set covers ⋮ Algorithmic methods for covering arrays of higher index ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roux-type constructions for covering arrays of strengths three and four
• Constructing strength three covering arrays with augmented annealing
• Equations over finite fields. An elementary approach
• Approximating probability distributions using small sample spaces
• On \(t\)-covering arrays
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On the state of strength-three covering arrays
• Randomized Postoptimization of Covering Arrays
• Paley graphs satisfy all first-order adjacency axioms
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• On the adjacency properties of paley graphs
• Binary Covering Arrays and Existentially Closed Graphs
• Covering arrays of higher strength from permutation vectors
• A Constructive Solution to a Tournament Problem

This page was built for publication: Covering arrays from cyclotomy