Linear hash families and forbidden configurations
From MaRDI portal
Publication:1009168
DOI10.1007/s10623-008-9266-7zbMath1283.05043OpenAlexW2002126102MaRDI QIDQ1009168
Charles J. Colbourn, Alan C. H. Ling
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9266-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (4)
Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ A hierarchical framework for recovery in compressive sensing ⋮ A recursive construction for perfect hash families ⋮ Improving two recursive constructions for covering arrays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roux-type constructions for covering arrays of strengths three and four
- Explicit constructions for perfect hash families
- Optimal linear perfect hash families
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Perfect hash families: Probabilistic methods and explicit constructions
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- A sequence approach to linear perfect hash families
- Geometric constructions of optimal linear perfect hash families
- Efficient Multiplicative Sharing Schemes
- On the state of strength-three covering arrays
- Optimal linear perfect hash families with small parameters
- Perfect Hash Families: Constructions and Existence
- Mutually orthogonal Latin squares: A brief survey of constructions
This page was built for publication: Linear hash families and forbidden configurations
