• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

On the Size of Identifying Codes in Binary Hypercubes

Svante Janson, Tero Laihonen, On the Size of Identifying Codes in Binary Hypercubes. Journal of Combinatorial Theory Series A 116(5), 1087–1096, 2009.

Abstract:

In this paper, we consider identifying codes in binary Hamming spaces Fn, i.e., in binary hypercubes. The concept of (r,⩽ℓ)-identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. Currently, the subject forms a topic of its own with several possible applications, for example, to sensor networks.

BibTeX entry:

@ARTICLE{jJaLa09a,
  title = {On the Size of Identifying Codes in Binary Hypercubes},
  author = {Janson, Svante and Laihonen, Tero},
  journal = {Journal of Combinatorial Theory Series A},
  volume = {116},
  number = {5},
  publisher = {Elsevier},
  pages = {1087–1096},
  year = {2009},
}

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

Publication Forum rating of this publication: level 3

Edit publication