On Codes Identifying Sets of Vertices in Hamming Spaces |
| |
| Authors: | Iiro Honkala Tero Laihonen Sanna Ranto |
| |
| Institution: | (1) Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland |
| |
| Abstract: | A code
is called (t,  2)-identifying if for all the words x, y(x  y) and
the sets (B
t
(x)  B
t
(y))  C and
are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of
-identifying codes and introduce weakly identifying codes. |
| |
| Keywords: | Identifying code Hamming space binary codes sets of vertices hypercube |
| 本文献已被 SpringerLink 等数据库收录！ |
