Finding codes on infinite grids automatically

arXiv2303.00557MaRDI QIDQ6428077FDOQ6428077

Publication date: 1 March 2023

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 a p p r o x 0.4206

for the minimum density of an identifying code on the infinite hexagonal grid, down from the previous record of

3 / 7 a p p r o x 0.4286

.

This page was built for publication: Finding codes on infinite grids automatically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428077)