The following pages link to Separating systems (Q1280741):
Displaying 15 items.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing (Q1727360) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Intersecting codes and separating codes (Q1811095) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance (Q2115728) (← links)
- Traceability codes and their generalizations (Q2190905) (← links)
- On generalized separating hash families (Q2469200) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Separation and Witnesses (Q5322994) (← links)
- A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system (Q6059063) (← links)
