Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the covering structures of two classes of linear codes from perfect nonlinear functions
IEEE Transactions on Information Theory
Covering and secret sharing with linear codes
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Secret sharing schemes from binary linear codes
Information Sciences: an International Journal
Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Note: The maximum number of minimal codewords in long codes
Discrete Applied Mathematics
| Hi-index | 0.06 |