Distributing hash families and covering arrays

MaRDI QIDQ5327064zbMATH OpenFDO

Authors Charles J. Colbourn

Publication date 1 August 2013

zbMATH Keywords

intersecting codescovering arraysperfect hash familiesdistributing hash familiesTuran families

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Recommendations

• Distributing hash families with few rows
• Heterogeneous hash families and covering arrays
• Covering arrays and hash families
• Constructing heterogeneous hash families by puncturing linear transversal designs
• Asymptotic and constructive methods for covering perfect hash families and covering arrays

Cited in

(18)

• Covering arrays from cyclotomy
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Constructing heterogeneous hash families by puncturing linear transversal designs
• Binary Covering Arrays and Existentially Closed Graphs
• Distributing hash families with few rows
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Linear hash families and forbidden configurations
• Improving two recursive constructions for covering arrays
• Heterogeneous hash families and covering arrays
• Covering arrays and hash families
• Subspace restrictions and affine composition for covering perfect hash families
• Covering strong separating hash families
• Perfect hash families, identifiable parent property codes and covering arrays.
• Deterministic coupon collection and better strong dispersers
• Efficient conditional expectation algorithms for constructing hash families
• Covering perfect hash families and covering arrays of higher index
• Randomized post-optimization of covering arrays
• Randomized Post-optimization for t-Restrictions

This page was built for publication: Distributing hash families and covering arrays

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