Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture
Journal of Combinatorial Theory Series A
Algebraic-geometric codes and asymptotic problems
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
Handbook of Coding Theory
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
SIAM Journal on Discrete Mathematics
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
More on (2,2)-separating systems
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Separating systems have earlier been shown to be useful in designing asynchronous sequential circuits, finite automata and fingerprinting. In this paper we study the problem of constructing (s,1)- separating systems from codes and designs.