scientific article

DOI10.3233/978-1-60750-663-8-99zbMath1341.68134MaRDI QIDQ3195092

Charles J. Colbourn

Publication date: 21 October 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

perfect hash familyseparating hash familycovering arraydistributing hash familyheterogeneous hash familyinteraction testing

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics in computer science (68R05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (14)

Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Strengthening hash families and compressive sensing ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Detecting arrays for effects of single factors ⋮ Augmentation of covering arrays of strength two ⋮ A hierarchical framework for recovery in compressive sensing ⋮ A group-based structure for perfect sequence covering arrays ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Randomized Post-optimization for t-Restrictions ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Cover starters for covering arrays of strength two ⋮ Resolvable covering arrays ⋮ Algorithmic methods for covering arrays of higher index ⋮ Upper Bounds on the Size of Covering Arrays

This page was built for publication: