A1 Refereed original research article in a scientific journal
Bounds on identifying codes
Authors: Blass U, Honkala I, Litsyn S
Publisher: ELSEVIER SCIENCE BV
Publication year: 2001
Journal: Discrete Mathematics
Journal name in source: DISCRETE MATHEMATICS
Journal acronym: DISCRETE MATH
Volume: 241
Issue: 1-3
First page : 119
Last page: 128
Number of pages: 10
ISSN: 0012-365X
DOI: https://doi.org/10.1016/S0012-365X(01)00113-3
Abstract
A code is called t-identifying if the sets B-t(x)boolean ANDC are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of length n are given. For example, we construct a 1-identifying code of length 7 with 32 codewords and show that it is optimal. (C) 2001 Elsevier Science B.V. All rights reserved.
A code is called t-identifying if the sets B-t(x)boolean ANDC are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of length n are given. For example, we construct a 1-identifying code of length 7 with 32 codewords and show that it is optimal. (C) 2001 Elsevier Science B.V. All rights reserved.
UTU Research Portal