Separating systems
From MaRDI portal
Publication:1280741
zbMath0913.94020MaRDI QIDQ1280741
Publication date: 16 March 1999
Published in: Problems of Information Transmission (Search for Journal in Brave)
Searching and sorting (68P10) Cryptography (94A60) Mathematical problems of computer architecture (68M07) Cyclic codes (94B15)
Related Items (15)
Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ Separation and Witnesses ⋮ A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system ⋮ Traceability codes and their generalizations ⋮ 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 ⋮ On generalized separating hash families ⋮ Cover-free codes and separating system codes ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Bounds on the rate of separating codes ⋮ Separable collusion-secure multimedia codes ⋮ Intersecting codes and separating codes ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
This page was built for publication: Separating systems
