Uniqueness of some optimal superimposed codes
From MaRDI portal
Recommendations
- On optimal superimposed codes
- Uniqueness of codes using semidefinite programming
- scientific article; zbMATH DE number 4164725
- Superimposed codes in R/sup n/
- Some new results on superimposed codes
- scientific article; zbMATH DE number 1421000
- scientific article; zbMATH DE number 2154113
- Bounds and algorithms for generalized superimposed codes
- On some optimal \((N,T,1,2)\) and \((N,T,1,3)\) superimposed codes
- Uniqueness of certain completely regular Hadamard codes
Cites work
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- scientific article; zbMATH DE number 2154117 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- scientific article; zbMATH DE number 1420996 (Why is no real title available?)
- Block designs with \(v=10\), \(k=5\), \(\lambda=4\)
- Bounds for key distribution patterns
- Families of finite sets in which no intersection of sets is covered by the union of s others
- Intersecting codes and partially identifying codes
- Interval packing and covering in the Boolean lattice
- Key distribution patterns using Minkowski planes
- Key storage in secure networks
- New constructions of superimposed codes
- Nonrandom binary superimposed codes
- On optimal superimposed codes
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Some constructions for key distribution patterns
- Some new results on superimposed codes
- Tracing traitors
Cited in
(3)
This page was built for publication: Uniqueness of some optimal superimposed codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q926629)
