Uniqueness of some optimal superimposed codes
From MaRDI portal
Publication:926629
DOI10.1134/S0032946007020044zbMath1160.94394MaRDI QIDQ926629
Publication date: 20 May 2008
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (1)
Cites Work
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Key storage in secure networks
- Block designs with \(v=10\), \(k=5\), \(\lambda=4\)
- Some constructions for key distribution patterns
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Key distribution patterns using Minkowski planes
- Bounds for key distribution patterns
- Interval Packing and Covering in the Boolean Lattice
- On optimal superimposed codes
- New constructions of superimposed codes
- Tracing traitors
- Nonrandom binary superimposed codes
- Some new results on superimposed codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Uniqueness of some optimal superimposed codes
