A1 Refereed original research article in a scientific journal
On identifying codes in binary Hamming spaces
Authors: Honkala I, Lobstein A
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Publication year: 2002
Journal: Journal of Combinatorial Theory, Series A
Journal name in source: JOURNAL OF COMBINATORIAL THEORY SERIES A
Journal acronym: J COMB THEORY A
Volume: 99
Issue: 2
First page : 232
Last page: 243
Number of pages: 12
ISSN: 0097-3165
DOI: https://doi.org/10.1006/jcta.2002.3263
Abstract
A binary code C subset of or equal to {0, 1}(n) is called r-identifying, if the sets B-r(x) boolean AND C, where B-r(x) is the set of all vectors within the Hamming distance r from x, are all nonempty and no two are the same. Denote by M-r(n) the minimum possible cardinality of a binary r-identifying code in {0, 1)(n). We prove that if rho is an element of [0, 1) is a constant, then lim(n-->infinity) n(-1) log(2) M-[rhon](n) = 1 - H(rho), where H(x) = -x log(2)x - (1 - x) log(2)(1 - x). We also prove that the problem whether or not a given binary linear code is lr-identifying is Pi(2)-complete. (C) 2002 Elsevier Science (USA).
A binary code C subset of or equal to {0, 1}(n) is called r-identifying, if the sets B-r(x) boolean AND C, where B-r(x) is the set of all vectors within the Hamming distance r from x, are all nonempty and no two are the same. Denote by M-r(n) the minimum possible cardinality of a binary r-identifying code in {0, 1)(n). We prove that if rho is an element of [0, 1) is a constant, then lim(n-->infinity) n(-1) log(2) M-[rhon](n) = 1 - H(rho), where H(x) = -x log(2)x - (1 - x) log(2)(1 - x). We also prove that the problem whether or not a given binary linear code is lr-identifying is Pi(2)-complete. (C) 2002 Elsevier Science (USA).
UTU Research Portal