On robust identification in the square and king grids




Laihonen T

PublisherELSEVIER SCIENCE BV

2006

Discrete Applied Mathematics

DISCRETE APPLIED MATHEMATICS

DISCRETE APPL MATH

154

17

2499

2510

12

0166-218X

DOIhttps://doi.org/10.1016/j.dam.2006.03.037



Fault diagnosis of multiprocessor systems gives the motivation for robust identifying codes. We provide robust identifying codes for the square and king grids. Often we are able to find optimal such codes. (c) 2006 Elsevier B.V. All rights reserved.



Last updated on 2024-26-11 at 14:13