Finding codes on infinite grids automatically
Combinatorics
2026-04-08 v4 Discrete Mathematics
Formal Languages and Automata Theory
Dynamical Systems
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 for the minimum density of an identifying code on the infinite hexagonal grid, down from the previous record of .
Keywords
Cite
@article{arxiv.2303.00557,
title = {Finding codes on infinite grids automatically},
author = {Ville Salo and Ilkka Törmä},
journal= {arXiv preprint arXiv:2303.00557},
year = {2026}
}
Comments
19 pages, 5 figures