Where academic tradition
meets the exciting future

New Bounds for (r, ≤ 2)-Identifying Codes in the Infinite King Grid

Mikko Pelto, New Bounds for (r, ≤ 2)-Identifying Codes in the Infinite King Grid. Cryptography and Communications 2(1), 41–47, 2010.

BibTeX entry:

@ARTICLE{jPelto10a,
  title = {New Bounds for (r, ≤ 2)-Identifying Codes in the Infinite King Grid},
  author = {Pelto, Mikko},
  journal = {Cryptography and Communications},
  volume = {2},
  number = {1},
  pages = {41–47},
  year = {2010},
}

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

Publication Forum rating of this publication: level 1

Edit publication