Separating systems
From MaRDI portal
Recommendations
Cited in
(21)- Separation in homogeneous systems with independent identical elements
- Separating systems of conjunctions.
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- Some intriguing upper bounds for separating hash families
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Bounds on the rate of separating codes
- Intersecting codes and separating codes
- Separable collusion-secure multimedia codes
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Traceability codes and their generalizations
- On generalized separating hash families
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Almost separating and almost secure frameproof codes over q-ary alphabets
- scientific article; zbMATH DE number 1982618 (Why is no real title available?)
- scientific article; zbMATH DE number 2080660 (Why is no real title available?)
- More on (2,2)-separating systems
- Cover-free codes and separating system codes
- Separation and Witnesses
- A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system
- Combinatorial constructions of separating codes
This page was built for publication: Separating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280741)
