Optimal error-detection system for identifying codes

DOI10.1002/NET.22254MaRDI QIDQ6663966zbMATH OpenFDO

Authors Devin C. Jean, Suk J. Seo

Publication date 15 January 2025

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22254

zbMATH Keywords

detection systemdominationfault-tolerantidentifying codeinfinite gridsNP-complete

Mathematics Subject Classification ID

Applications of graph theory (05C90) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites work

• An optimal locating-dominating set in the infinite triangular grid
• Bounds for codes identifying vertices in the hexagonal grid
• Codes for identification in the king lattice
• Density of identifying codes of hexagonal grids with finite number of rows
• Domination and location in acyclic graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Fault tolerant detectors for distinguishing sets in graphs
• Fault-tolerant locating-dominating sets
• Finding codes on infinite grids automatically
• Generalized set dominating and separating systems
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6889668 (Why is no real title available?)
• Identifying codes with small radius in some infinite regular graphs
• Locating-dominating sets in twin-free graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• On a new class of codes for identifying vertices in graphs
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On identification in the triangular grid
• On identifying codes
• On identifying codes in the hexagonal mesh
• On locating--dominating sets in infinite grids
• On robust and dynamic identifying codes
• On strongly identifying codes
• On the identification of sets of points in the square lattice
• Optimal open-locating-dominating sets in infinite triangular grids
• Progress on fault-tolerant locating-dominating sets
• The minimum density of an identifying code in the king lattice.
• Tolerant location detection in sensor networks

Cited in

(3)

• Fault-tolerant locating-dominating sets with error-correction
• On full-separating sets and related codes in graphs
• On the density of (1, )-locating-dominating codes in the infinite square grid

This page was built for publication: Optimal error-detection system for identifying codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663966)