Title of article :
Bounds on identifying codes Original Research Article
Author/Authors :
Uri Blass، نويسنده , , Iiro Honkala، نويسنده , , Simon Litsyn، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
A code is called t-identifying if the sets Bt(x)∩C 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.
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
