A1 Refereed original research article in a scientific journal

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



Authors: Laihonen T

Publisher: SPRINGER TOKYO

Publication year: 2006

Journal: Graphs and Combinatorics

Journal name in source: GRAPHS AND COMBINATORICS

Journal acronym: GRAPH COMBINATOR

Volume: 22

Issue: 4

First page : 487

Last page: 496

Number of pages: 10

ISSN: 0911-0119

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


Abstract
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.



Last updated on 2024-26-11 at 19:24