On the Characterization of Linear Uniquely Decodable Codes
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Constructing Covering Codes with Given Automorphisms
Designs, Codes and Cryptography
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
Perfect domination sets in Cayley graphs
Discrete Applied Mathematics
Designs, Codes and Cryptography
Hi-index | 0.00 |