Constructions of covering arrays of strength five
From MaRDI portal
Publication:663479
DOI10.1007/s10623-011-9505-1zbMath1248.05025OpenAlexW1991020996MaRDI QIDQ663479
Jianxing Yin, Lijun Ji, Yang Li
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9505-1
upper boundsorthogonal arraydifference matrixcovering arraydifference covering arrayholey difference matrix
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- Roux-type constructions for covering arrays of strengths three and four
- Constructions of new orthogonal arrays and covering arrays of strength three
- Covering arrays of strength 3 and 4 from holey difference matrices
- Constructions of difference covering arrays.
- Further results on optimal optical orthogonal codes with weight 4.
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Strength two covering arrays: existence tables and projection
- Randomized Postoptimization of Covering Arrays
- Combinatorial Designs
- Transverse quadruple systems with five holes
- Products of mixed covering arrays of strength two
- Covering arrays of higher strength from permutation vectors
This page was built for publication: Constructions of covering arrays of strength five
