Bounds for codes identifying vertices in the hexagonal grid

Cohen GD, Honkala I, Lobstein A, Z ´emor G · 2000 · DOI 10.1137/s0895480199360990

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

math.CO · 2023-03-01 · unverdicted · novelty 5.0

New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.

Showing 1 of 1 citing paper.

Finding codes on infinite grids automatically math.CO · 2023-03-01 · unverdicted · none · ref 3
New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.