An extension of a construction of covering arrays

DOI10.1002/jcd.21747OpenAlexW3047392627MaRDI QIDQ6188123

Daniel Wevrick, Brett Stevens, Daniel Panario, Mark Saaltink

Publication date: 1 February 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21747

zbMATH Keywords

finite fieldprimitive polynomialcovering arraypseudo-ordercovering perfect hash family

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites Work

• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Roux-type constructions for covering arrays of strengths three and four
• Constructing new covering arrays from LFSR sequences over finite fields
• Tabu search for covering arrays using permutation vectors
• Covering arrays of strength three
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Covering arrays of strength three from extended permutation vectors
• Improved covering arrays using covering perfect hash families with groups of restricted entries
• Handbook of Finite Fields
• On the state of strength-three covering arrays
• A constructive proof of the general lovász local lemma
• Primary cyclotomic units and a proof of Catalans conjecture
• Subspace restrictions and affine composition for covering perfect hash families
• Covering arrays of higher strength from permutation vectors
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item