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