scientific article; zbMATH DE number 1462939
From MaRDI portal
Publication:4487082
Recommendations
- Perfect Hash Families: Constructions and Existence
- Explicit constructions for perfect hash families
- Perfect hash families: Probabilistic methods and explicit constructions
- Improved bounds for separating hash families
- Explicit constructions of perfect hash families from algebraic curves over finite fields
Cites work
- Construction of orthogonal arrays
- Explicit construction of exponential sized families of k-independent sets
- Families of finite sets in which no set is covered by the union of two others
- scientific article; zbMATH DE number 1228785 (Why is no real title available?)
- scientific article; zbMATH DE number 1024067 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- Key storage in secure networks
- New combinatorial designs and their applications to group testing
- Nonrandom binary superimposed codes
- On r-cover-free families
- On key storage in secure networks
- Optimal linear perfect hash families
- Some new results on key distribution patterns and broadcast encryption
Cited in
(49)- Explicit constructions for perfect hash families
- Super-simple balanced incomplete block designs with block size 4 and index 5
- Super-simple group divisible designs with block size 4 and index 5
- Perfect hash families: Probabilistic methods and explicit constructions
- Non-adaptive learning of a hidden hypergraph
- Some intriguing upper bounds for separating hash families
- New constructions for IPP codes
- Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4
- Super-simple twofold Steiner pentagon systems
- The orthogonality spectrum for Latin squares of different orders
- Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\)
- Super-simple \((5, 4)\)-GDDs of group type \(g^u\)
- On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\)
- Super-simple balanced incomplete block designs with block size 4 and index 9
- Super-simple cyclic designs with small values
- Super-simple pairwise balanced designs with block sizes 3 and 4
- Completely reducible super-simple designs with block size four and related super-simple packings
- Bounds for separating hash families
- Super-simple balanced incomplete block designs with block size 5 and index 3
- On generalized separating hash families
- Recursive constructions of secure codes and hash families using difference function families.
- Super-simple \((\nu, 5, 5)\) designs
- Distributing the encryption and decryption of a block cipher
- Anonymity in shared symmetric key primitives
- Non-adaptive learning of a hidden hypergraph
- Linear Time Constructions of Some d-Restriction Problems
- On the state of strength-three covering arrays
- Perfect hash families, identifiable parent property codes and covering arrays.
- Improved bounds for separating hash families
- On the embedding of groups and designs in a difference block design
- Almost optimal cover-free families
- Perfect hash families from transversal designs
- Perfect Hash Families: Constructions and Existence
- Separating hash families: a Johnson-type bound and new constructions
- The combinatorics of generalised cumulative arrays
- Super-simple group divisible designs with block size 4 and index 9
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Separating codes and a new combinatorial search model
- Separating hash families with large universe
- Super-simple balanced incomplete block designs with block size 5 and index 8
- Roux-type constructions for covering arrays of strengths three and four
- Secret sharing schemes with partial broadcast channels
- Explicit constructions of separating hash families from algebraic curves over finite fields
- Super-simple \((v,5,4)\) designs
- Uniqueness of some optimal superimposed codes
- Super-simple, pan-orientable and pan-decomposable GDDs with block size 4
- Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures
- Super-simple group divisible designs with block size 4 and index 2
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487082)
