Optimal t-edge-robust r-identifying codes in the king lattice

: Laihonen T

Publisher: SPRINGER TOKYO

: 2006

: Graphs and Combinatorics

: GRAPHS AND COMBINATORICS

: GRAPH COMBINATOR

: 22

: 4

: 487

: 496

: 10

: 0911-0119

DOI: https://doi.org/10.1007/s00373-006-0682-z

Locating faulty processors in a multiprocessor system gives a motivation for identifying codes. The concept of a t-edge-robust r-identifying code was introduced in [8]. We consider these codes in the king lattice and give several optimal densities.