The number of completely different optimal identifying codes in the infinite square grid
From MaRDI portal
Publication:2410258
Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Theory of error-correcting codes and error-detecting codes (94B99)
Recommendations
Cites work
Cited in
(8)- Lower bounds for identifying codes in some infinite grids
- Optimal identifying codes of two families of Cayley graphs
- Completely regular codes in the infinite hexagonal grid
- New lower bound for 2-identifying code in the square grid
- Minimum-Density Identifying Codes in Square Grids
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- On the density of (1, )-locating-dominating codes in the infinite square grid
- An optimal strongly identifying code in the infinite triangular grid
This page was built for publication: The number of completely different optimal identifying codes in the infinite square grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410258)