Finding codes on infinite grids automatically

TL;DR

This work applies automata theory and Karp’s minimum mean weight cycle algorithm to minimum density problems in coding theory and finds the new upper bound 53/126 ≈ 0.4206 for the minimum density of an identifying code on the infinite hexagonal grid.

Abstract

We apply automata theory and Karp's minimum mean weight cycle algorithm to minimum density problems in coding theory. Using this method, we find the new upper bound $53/126 \approx 0.4206$ for the minimum density of an identifying code on the infinite hexagonal grid, down from the previous record of $3/7 \approx 0.4286$.

Figures (1)

• Figure 1: An identifying code with density ? on the hexagonal grid.