Optimal error-detection system for identifying codes
From MaRDI portal
Publication:6663966
DOI10.1002/net.22254MaRDI QIDQ6663966
Publication date: 15 January 2025
Published in: Networks (Search for Journal in Brave)
Applications of graph theory (05C90) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On locating--dominating sets in infinite grids
- Fault tolerant detectors for distinguishing sets in graphs
- Locating-dominating sets in twin-free graphs
- On identifying codes in the hexagonal mesh
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- The minimum density of an identifying code in the king lattice.
- Codes for identification in the king lattice
- Fault-tolerant locating-dominating sets
- On strongly identifying codes
- On identification in the triangular grid
- On the identification of sets of points in the square lattice
- Tolerant location detection in sensor networks
- Optimal open-locating-dominating sets in infinite triangular grids
- An optimal locating-dominating set in the infinite triangular grid
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- Bounds for codes identifying vertices in the hexagonal grid
- On identifying codes
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On robust and dynamic identifying codes
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Identifying codes with small radius in some infinite regular graphs
- Progress on fault-tolerant locating-dominating sets
- Density of identifying codes of hexagonal grids with finite number of rows
- Finding codes on infinite grids automatically
This page was built for publication: Optimal error-detection system for identifying codes
