\input zb-basic
\input zb-ioport
\iteman{io-port 01687457}
\itemau{Blass, Uri; Honkala, Iiro; Litsyn, Simon}
\itemti{Bounds on identifying codes.}
\itemso{Discrete Math. 241, No.1-3, 119-128 (2001).}
\itemab
Summary: A code is called $t$-identifying if the sets $B_t({\bold x})\cap 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, the authors construct a 1-identifying code of length 7 with 32 codewords and show that it is optimal.
\itemrv{~}
\itemcc{}
\itemut{1-identifying codes; lower bounds on the minimum cardinality}
\itemli{doi:10.1016/S0012-365X(01)00113-3}
\end