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

Improved upper bounds on binary identifying codes

Geoffrey Exoo, Tero Laihonen, Sanna Ranto, Improved upper bounds on binary identifying codes. IEEE Transactions on Information Theory 53(11), 4255–4260, 2007.

Abstract:

In binary Hamming spaces, we construct new 1-identifying codes from 2-fold 1-coverings that are 1-identifying. We improve on previously known upper bounds for the cardinalities of 1 -identifying codes of many lengths when n > 10. We construct t-identifying codes using the direct sum of t 1-identifying codes. This solves partly an open problem posed by Blass, Honkala, and Litsyn in 2001. We also prove a general result concerning the direct sum of a t-identifying code with the whole space of any dimension.

BibTeX entry:

@ARTICLE{jExLaRa07a,
  title = {Improved upper bounds on binary identifying codes},
  author = {Exoo, Geoffrey and Laihonen, Tero and Ranto, Sanna},
  journal = {IEEE Transactions on Information Theory },
  volume = {53},
  number = {11},
  publisher = {IEEE},
  pages = {4255–4260},
  year = {2007},
}

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

Publication Forum rating of this publication: level 3

Edit publication