Bounds on identifying codes

: Blass U, Honkala I, Litsyn S

Publisher: ELSEVIER SCIENCE BV

: 2001

: Discrete Mathematics

: DISCRETE MATHEMATICS

: DISCRETE MATH

: 241

: 1-3

: 119

: 128

: 10

: 0012-365X

DOI: https://doi.org/10.1016/S0012-365X(01)00113-3(external)

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.

Mathematics