Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Discrete Mathematics

arXiv:2204.11362 (cs)
[Submitted on 24 Apr 2022]

Title:Error-correcting Identifying Codes

Authors:Devin Jean, Suk Seo
View PDF
Abstract: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.
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
MSC classes: 05C69
Cite as: arXiv:2204.11362 [cs.DM]
  (or arXiv:2204.11362v1 [cs.DM] for this version)
  https://doi.org/10.48550/arXiv.2204.11362

Submission history

From: Devin Jean [view email]
[v1] Sun, 24 Apr 2022 21:24:51 UTC (1,473 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.DM
< prev   |   next >
new | recent | 2022-04
Change to browse by:
cs
math
math.CO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)