Separating Partition Systems and Locally Different Sequences
From MaRDI portal
Recommendations
Cited in
(22)- Combinatorics of separation by binary matrices
- On the maximum number of qualitative independent partitions
- New upper bounds on cardinality of separating systems
- Two applications of separating systems to nonadaptive procedures
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Intersecting codes and separating codes
- On the extremal combinatorics of the Hamming space
- On separating families of bipartitions
- Separable collusion-secure multimedia codes
- On colorful edge triples in edge-colored complete graphs
- Intersecting codes and partially identifying codes
- Almost separating and almost secure frameproof codes over q-ary alphabets
- scientific article; zbMATH DE number 994587 (Why is no real title available?)
- Separating collections
- scientific article; zbMATH DE number 1959630 (Why is no real title available?)
- Separation and Witnesses
- Some new p-ary two-secure frameproof codes
- Near-sunflowers and focal families
- Improved upper bounds for the rate of separating and completely separating codes
- Combinatorial constructions of separating codes
- Applications of coding theory to communication combinatorial problems
This page was built for publication: Separating Partition Systems and Locally Different Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211322)