scientific article; zbMATH DE number 1462939
From MaRDI portal
Publication:4487082
DOI<189::AID-JCD4>3.0.CO;2-A 10.1002/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-AzbMath0956.68159MaRDI QIDQ4487082
Lie Zhu, Rui Zhong Wei, Douglas R. Stinson
Publication date: 12 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)
Related Items (44)
Almost Optimal Cover-Free Families ⋮ Super-simple cyclic designs with small values ⋮ Super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ Perfect Hash Families: Constructions and Existence ⋮ Anonymity in shared symmetric key primitives ⋮ 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 ⋮ Improved bounds for separating hash families ⋮ Super-simple \((v,5,4)\) designs ⋮ Super-simple twofold Steiner pentagon systems ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Separating codes and a new combinatorial search model ⋮ The orthogonality spectrum for Latin squares of different orders ⋮ Completely reducible super-simple designs with block size four and related super-simple packings ⋮ Bounds for separating hash families ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Super-simple balanced incomplete block designs with block size 5 and index 3 ⋮ Uniqueness of some optimal superimposed codes ⋮ Some intriguing upper bounds for separating hash families ⋮ Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\) ⋮ On generalized separating hash families ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 ⋮ Super-simple \((5, 4)\)-GDDs of group type \(g^u\) ⋮ 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 9 ⋮ Super-simple group divisible designs with block size 4 and index 2 ⋮ Recursive constructions of secure codes and hash families using difference function families. ⋮ Super-simple \((\nu, 5, 5)\) designs ⋮ 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 ⋮ New constructions for IPP codes ⋮ Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ The combinatorics of generalised cumulative arrays ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Explicit constructions for perfect hash families ⋮ Non-adaptive Learning of a Hidden Hypergraph ⋮ 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 ⋮ Distributing the encryption and decryption of a block cipher ⋮ ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN ⋮ On the state of strength-three covering arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New combinatorial designs and their applications to group testing
- Explicit construction of exponential sized families of k-independent sets
- Key storage in secure networks
- Families of finite sets in which no set is covered by the union of two others
- Some new results on key distribution patterns and broadcast encryption
- Optimal linear perfect hash families
- Construction of orthogonal arrays
- On key storage in secure networks
- On \(r\)-cover-free families
- Nonrandom binary superimposed codes
This page was built for publication:
