Constructing heterogeneous hash families by puncturing linear transversal designs

DOI10.1007/S00022-011-0083-1zbMATH Open1245.05010OpenAlexW2058458468MaRDI QIDQ408964FDOQ408964

Charles J. Colbourn

Publication date: 12 April 2012

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-011-0083-1

Recommendations

• Heterogeneous hash families and covering arrays
• Distributing hash families and covering arrays
• Distributing hash families with few rows
• Covering arrays and hash families
• Linear hash families and forbidden configurations

zbMATH Keywords

perfect hash familyseparating hash familycovering arraydistributing hash familyheterogeneous hash familyinteraction testingthwart

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Locating and detecting arrays for interaction faults
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orthogonal Arrays of Index Unity
• Mutually orthogonal Latin squares: A brief survey of constructions
• The packing problem in statistics, coding theory and finite projective spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect hashing
• Explicit constructions for perfect hash families
• Title not available (Why is that?)
• Perfect Hash Families: Constructions and Existence
• Packing arrays
• Packing arrays and packing designs
• Linear hash families and forbidden configurations
• Merging covering arrays and compressing multiple sequence alignments
• On small sumsets in an abelian group
• Blocking sets
• More thwarts in transversal designs
• Transversal designs in classical planes and spaces
• Adaptive versus nonadaptive attribute-efficient learning
• Thwarts in transversal designs
• On \(t\)-covering arrays
• A sequence approach to linear perfect hash families
• Geometric constructions of optimal linear perfect hash families
• Title not available (Why is that?)
• Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
• Optimal linear perfect hash families with small parameters
• Title not available (Why is that?)
• A recursive construction for perfect hash families
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Addition of Residue Classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• AETG

This page was built for publication: Constructing heterogeneous hash families by puncturing linear transversal designs

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