Covering arrays from cyclotomy
From MaRDI portal
Publication:970532
Recommendations
- Covering arrays via set covers
- scientific article; zbMATH DE number 5177325
- Recursive constructions of covering arrays
- On t-covering arrays
- Algebraic techniques for covering arrays and related structures
- Covering and radius-covering arrays: constructions and classification
- Covering arrays on graphs
- Some cyclic covers of complements of arrangements
- Covering cycle matroid
- Recursive constructions for t-covering arrays
Cites work
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- A Constructive Solution to a Tournament Problem
- Approximating probability distributions using small sample spaces
- Binary Covering Arrays and Existentially Closed Graphs
- Constructing strength three covering arrays with augmented annealing
- Covering arrays of higher strength from permutation vectors
- Distributing hash families and covering arrays
- Equations over finite fields. An elementary approach
- Families of \(k\)-independent sets
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- On t-covering arrays
- On the adjacency properties of paley graphs
- On the state of strength-three covering arrays
- Paley graphs satisfy all first-order adjacency axioms
- Randomized postoptimization of covering arrays
- Recursive constructions of covering arrays
- Roux-type constructions for covering arrays of strengths three and four
- Software and hardware testing using combinatorial covering suites
- Two applications (for search theory and truth functions) of Sperner type theorems
Cited in
(27)- Covering arrays from m-sequences and character sums
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Number of \(t\)-tuples in arrays from LFSRs
- Randomized post-optimization of covering arrays
- New covering array numbers
- In-parameter-order strategies for covering perfect hash families
- Algorithmic methods for covering arrays of higher index
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
- A greedy algorithm to construct covering arrays using a graph representation
- Arrays for combinatorial interaction testing: a review on constructive approaches
- A survey on the problems and algorithms for covering arrays via set covers
- Arrays composed from the extended rational cycle
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- Covering arrays, augmentation, and quilting arrays
- On the entry sum of cyclotomic arrays
- Suitable permutations, binary covering arrays, and Paley matrices
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- Algebraic modelling of covering arrays
- Group construction of covering arrays
- A primer on the application of neural networks to covering array generation
- A two-stage algorithm for combinatorial testing
- Comparing balanced sequences obtained from ElGamal function to random balanced sequences
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- New families of strength-3 covering arrays using linear feedback shift register sequences
- Covering and radius-covering arrays: constructions and classification
- Constructing new covering arrays from LFSR sequences over finite fields
- Finite field constructions of combinatorial arrays
This page was built for publication: Covering arrays from cyclotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970532)
