Subspace restrictions and affine composition for covering perfect hash families

DOI10.26493/2590-9770.1220.3A1MaRDI QIDQ5198019zbMATH OpenOpenAlexWikidataFDO

Authors Charles J. Colbourn, Erin Lanus

Publication date 2 October 2019

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/2590-9770.1220.3a1

zbMATH Keywords

affine compositioncovering arraycovering perfect hash familysubspace restriction

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40) Other finite linear geometries (51E26) Combinatorics in computer science (68R05)

Recommendations

• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Improved covering arrays using covering perfect hash families with groups of restricted entries
• Distributing hash families and covering arrays
• Distributing hash families with few rows
• Covering arrays and hash families

Cites work

• A construction for strength-3 covering arrays from linear feedback shift register sequences
• A greedy-metaheuristic 3-stage approach to construct covering arrays
• Adaptive versus nonadaptive attribute-efficient learning
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Constructing new covering arrays from LFSR sequences over finite fields
• Constructing strength three covering arrays with augmented annealing
• Covering arrays of higher strength from permutation vectors
• Covering arrays of strength three from extended permutation vectors
• Introduction to combinatorial testing
• On t-covering arrays
• On the state of strength-three covering arrays
• Products of mixed covering arrays of strength two
• Randomized post-optimization of covering arrays
• Recursive constructions of covering arrays
• Roux-type constructions for covering arrays of strengths three and four
• Subcube fault-tolerance in hypercubes
• Tabu search for covering arrays using permutation vectors
• Vector sets for exhaustive testing of logic circuits

Cited in

(7)

• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• In-parameter-order strategies for covering perfect hash families
• Improved covering arrays using covering perfect hash families with groups of restricted entries
• Covering perfect hash families and covering arrays of higher index
• An extension of a construction of covering arrays
• Detecting arrays for effects of multiple interacting factors
• New families of strength-3 covering arrays using linear feedback shift register sequences

This page was built for publication: Subspace restrictions and affine composition for covering perfect hash families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5198019)