Where academic tradition
meets the exciting future

Families of Optimal Codes for Strong Identification

Tero Laihonen, Sanna Ranto, Families of Optimal Codes for Strong Identification. Discrete Applied Mathematics 121, 203–213, 2002.

BibTeX entry:

@ARTICLE{jLaRaa,
  title = {Families of Optimal Codes for Strong Identification},
  author = {Laihonen, Tero and Ranto, Sanna},
  journal = {Discrete Applied Mathematics},
  volume = {121},
  pages = {203–213},
  year = {2002},
  keywords = {Binary code, Identifying code, Strongly identifying code, Optimal code, Hamming space},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication