Error-correcting Identifying Codes

04/24/2022
by   Devin Jean, et al.
0

Assume that a graph G models a detection system for a facility with a possible "intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing (the minimum number of) detectors at a subset of vertices in G to automatically determine if there is an intruder, and if so, its precise location. In this research we explore a fault-tolerant variant of identifying codes, known as error-correcting identifying codes, which permit one false positive or negative and are applicable to real-world systems. We present the proof of NP-completeness of the problem of determining said minimum size in arbitrary graphs, and determine bounds on the parameter in cubic graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2022

Optimal Error-detection system for Identifying Codes

Assume that a graph G models a detection system for a facility with a po...
research
12/03/2021

Fault-tolerant Identifying Codes in Special Classes of Graphs

A detection system, modeled in a graph, is composed of "detectors" posit...
research
07/30/2023

Open-locating-dominating sets with error correction

An open-locating-dominating set of a graph models a detection system for...
research
12/15/2022

Fault-Tolerant Locating-Dominating sets with Error-correction

A locating-dominating set is a subset of vertices representing "detector...
research
01/23/2022

Fault-tolerant Locating-Dominating Sets on the Infinite King Grid

Let G be a graph of a network system with vertices, V(G), representing p...
research
02/05/2018

Optimal bounds on codes for location in circulant graphs

Identifying and locating-dominating codes have been studied widely in ci...
research
11/27/2022

Fault-Tolerant Detection Systems on the King's Grid

A detection system, modeled in a graph, uses "detectors" on a subset of ...

Please sign up or login with your details

Forgot password? Click here to reset