Heterogeneous hash families and covering arrays

zbMATH Open1226.05061MaRDI QIDQ3000893FDOQ3000893

Authors: Charles J. Colbourn, Jose Torres-Jimenez 

Publication date: 31 May 2011

Recommendations

• Distributing hash families and covering arrays
• Distributing hash families with few rows
• Constructing heterogeneous hash families by puncturing linear transversal designs
• Covering arrays and hash families
• Perfect hash families: the generalization to higher indices

zbMATH Keywords

perfect hash familycovering arraydistributing hash familyheterogeneous hash family

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)

Cited In (14)

• Constructing heterogeneous hash families by puncturing linear transversal designs
• 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
• Distributing hash families and covering arrays
• Perfect hash families: the generalization to higher indices
• 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
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Phorma: perfectly hashable order restricted multidimensional arrays
• Strengthening hash families and compressive sensing

Uses Software

• AETG

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

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