Constructions of new orthogonal arrays and covering arrays of strength three
From MaRDI portal
Publication:965209
DOI10.1016/j.jcta.2009.06.002zbMath1228.05087MaRDI QIDQ965209
Publication date: 21 April 2010
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.2009.06.002
05B15: Orthogonal arrays, Latin squares, Room squares
Related Items
Quantum combinatorial designs and k-uniform states, On the Existence of S(3,{4,5,7},v), Optimum detecting arrays for independent interaction faults, An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\), Multimagic rectangles based on large sets of orthogonal arrays, A construction for \(t\)-fold perfect authentication codes with arbitration, Optimum mixed level detecting arrays, Some constructions for \(t\) pairwise orthogonal diagonal Latin squares based on difference matrices, Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\), On the existence of orthogonal arrays OA\((3,5,4n+2)\), The equivalence between optimal detecting arrays and super-simple OAs, Constructions of covering arrays of strength five, A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities, Covering arrays of strength 3 and 4 from holey difference matrices, Ideal ramp schemes and augmented orthogonal arrays, Detecting arrays and their optimality, Further results on the existence of nested orthogonal arrays, A construction of variable strength covering arrays, Construction of mixed orthogonal arrays with high strength, Further results on 2-uniform states arising from irredundant orthogonal arrays, Consecutive detecting arrays for interaction faults, Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\), Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s, Super-simple \((5, 4)\)-GDDs of group type \(g^u\), Mixed covering arrays of strength three with few factors, Arrays for combinatorial interaction testing: a review on constructive approaches, Resolvable covering arrays, Optimality and constructions of locating arrays, Construction of symmetric and asymmetric orthogonal arrays of strength \(t\) from orthogonal partition, On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration, Super-simple balanced incomplete block designs with block size 5 and index 3, New results for 2-uniform states based on irredundant orthogonal arrays, Quantum \(k\)-uniform states for heterogeneous systems from irredundant mixed orthogonal arrays, Some New Infinite Classes of Candelabra Quadruple Systems, Large Sets of Orthogonal Arrays and Multimagic Squares, MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays, Constructions of nets via OAs of strength 3 with a prescribed property, Correction to: “Transverse quadruple systems with five holes”
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On qualitatively independent partitions and related problems
- Lower bounds for transversal covers
- Orthogonal arrays. Theory and applications
- Constructions of difference covering arrays.
- Constructions for Steiner quadruple systems with a spanning block design
- Problems and algorithms for covering arrays
- Cyclic difference packing and covering arrays.
- On (\(g\), 4; 1)-difference matrices
- On the state of strength-three covering arrays
- Vector sets for exhaustive testing of logic circuits
- Partial λ-Geometries and Generalized Hadamard Matrices Over Groups
- Covering arrays and intersecting codes
- Compressing inconsistent data
- Transverse quadruple systems with five holes
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity
