A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On the size of identifying codes in binary hypercubes
Tekijät: Janson S, Laihonen T
Kustantaja: ACADEMIC PRESS INC ELSEVIER SCIENCE
Julkaisuvuosi: 2009
Journal: Journal of Combinatorial Theory, Series A
Tietokannassa oleva lehden nimi: JOURNAL OF COMBINATORIAL THEORY SERIES A
Lehden akronyymi: J COMB THEORY A
Vuosikerta: 116
Numero: 5
Aloitussivu: 1087
Lopetussivu: 1096
Sivujen määrä: 10
ISSN: 0097-3165
DOI: https://doi.org/10.1016/j.jcta.2009.02.004
Tiivistelmä
where r = left perpendicular rho nright perpendicular, rho epsilon [0, 1) and h(x) is the binary entropy function. In this paper, we prove that this result holds for any fixed l >= 1 when rho epsilon [0, 1/2). We also show that M(r)((<= l))(n) = O(n(3/2)) for every fixed l and r slightly less than n/2, and give an explicit construction of small (r, <= 2)-identifying codes for r = left perpendicularn/2right perpendicular - 1. (C) 2009 Elsevier Inc. All rights reserved.
where r = left perpendicular rho nright perpendicular, rho epsilon [0, 1) and h(x) is the binary entropy function. In this paper, we prove that this result holds for any fixed l >= 1 when rho epsilon [0, 1/2). We also show that M(r)((<= l))(n) = O(n(3/2)) for every fixed l and r slightly less than n/2, and give an explicit construction of small (r, <= 2)-identifying codes for r = left perpendicularn/2right perpendicular - 1. (C) 2009 Elsevier Inc. All rights reserved.
Turun yliopiston Tutkimustietojärjestelmän portaali