On optimal edge-robust and vertex-robust (1,<= l)-identifying codes

: Laihonen T

Publisher: SIAM PUBLICATIONS

: 2005

: Siam Journal on Discrete Mathematics

: SIAM JOURNAL ON DISCRETE MATHEMATICS

: SIAM J DISCRETE MATH

: 18

: 4

: 825

: 834

: 10

: 0895-4801

DOI: https://doi.org/10.1137/S0895480104440754

The motivation for identifying codes comes from maintenance of multiprocessor architectures. In this paper, we give infinite families of optimal edge- robust identifying codes and vertex- robust identifying codes in binary Hamming spaces.