Constructing heterogeneous hash families by puncturing linear transversal designs

DOI10.1007/S00022-011-0083-1MaRDI QIDQ408964zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

perfect hash familyseparating hash familycovering arraydistributing hash familyheterogeneous hash familyinteraction testingthwart

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• scientific article; zbMATH DE number 3917102 (Why is no real title available?)
• scientific article; zbMATH DE number 53569 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1228785 (Why is no real title available?)
• scientific article; zbMATH DE number 1341368 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 1759800 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• scientific article; zbMATH DE number 898422 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A recursive construction for perfect hash families
• A sequence approach to linear perfect hash families
• Adaptive versus nonadaptive attribute-efficient learning
• Blocking sets
• Distributing hash families and covering arrays
• Explicit constructions for perfect hash families
• Geometric constructions of optimal linear perfect hash families
• Heterogeneous hash families and covering arrays
• Linear hash families and forbidden configurations
• Locating and detecting arrays for interaction faults
• Locating errors using ELAs, covering arrays, and adaptive testing algorithms
• Merging covering arrays and compressing multiple sequence alignments
• More thwarts in transversal designs
• Mutually orthogonal Latin squares: A brief survey of constructions
• On t-covering arrays
• On small sumsets in an abelian group
• On the Addition of Residue Classes
• Optimal linear perfect hash families with small parameters
• Orthogonal Arrays of Index Unity
• Packing arrays
• Packing arrays and packing designs
• Perfect Hash Families: Constructions and Existence
• Perfect hash families from transversal designs
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect hashing
• Software and hardware testing using combinatorial covering suites
• The CRC handbook of combinatorial designs
• The packing problem in statistics, coding theory and finite projective spaces
• Thwarts in transversal designs
• Transversal designs in classical planes and spaces

Cited in

(3)

• Distributing hash families with few rows
• Heterogeneous hash families and covering arrays
• Distributing hash families and covering arrays

Describes a project that uses

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)