A New Class of Optimal 3-splitting Authentication Codes
Designs, Codes and Cryptography
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Combinatorial bounds and characterizations of splitting authentication codes
Cryptography and Communications
A new class of splitting 3-designs
Designs, Codes and Cryptography
A new class of 3-fold perfect splitting authentication codes
Designs, Codes and Cryptography
Hi-index | 0.00 |
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems ...