A1 Refereed original research article in a scientific journal
Improved bounds on identifying codes in binary Hamming spaces
Authors: Exoo Geoffrey, Junnila Ville, Laihonen Tero, Ranto Sanna
Publisher: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Publication year: 2010
Journal: European Journal of Combinatorics
Journal name in source: EUROPEAN JOURNAL OF COMBINATORICS
Journal acronym: EUR J COMBIN
Number in series: 3
Volume: 31
Issue: 3
First page : 813
Last page: 827
Number of pages: 15
ISSN: 0195-6698
DOI: https://doi.org/10.1016/j.ejc.2009.09.002
Abstract
In this paper, we present various results concerning (r. <= l)-identifying codes in the Hamming space F(n). First we concentrate on Improving the lower bounds on (r. <= 1)-identifying codes for r > 1 Then we proceed by introducing new lower hounds on (r. <= l)-identifying codes with l >= 2 We also prove that (r, <= l)-identifying codes can be constructed frorn known ones using a suitable direct sum when l > 2 Constructions for (r. <= 2)-identifying codes with the best known cardinalities are also given (C) 2009 Elsevier Ltd All rights reserved.
In this paper, we present various results concerning (r. <= l)-identifying codes in the Hamming space F(n). First we concentrate on Improving the lower bounds on (r. <= 1)-identifying codes for r > 1 Then we proceed by introducing new lower hounds on (r. <= l)-identifying codes with l >= 2 We also prove that (r, <= l)-identifying codes can be constructed frorn known ones using a suitable direct sum when l > 2 Constructions for (r. <= 2)-identifying codes with the best known cardinalities are also given (C) 2009 Elsevier Ltd All rights reserved.
UTU Research Portal