A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Improved bounds on identifying codes in binary Hamming spaces
Tekijät: Exoo Geoffrey, Junnila Ville, Laihonen Tero, Ranto Sanna
Kustantaja: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Julkaisuvuosi: 2010
Journal: European Journal of Combinatorics
Tietokannassa oleva lehden nimi: EUROPEAN JOURNAL OF COMBINATORICS
Lehden akronyymi: EUR J COMBIN
Numero sarjassa: 3
Vuosikerta: 31
Numero: 3
Aloitussivu: 813
Lopetussivu: 827
Sivujen määrä: 15
ISSN: 0195-6698
DOI: https://doi.org/10.1016/j.ejc.2009.09.002
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali