Error-correcting codes from -resolving sets
arXiv:1605.03141
Abstract
We demonstrate a construction of error-correcting codes from graphs by means of -resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the -metric dimension of grid graphs (i.e. Cartesian products of paths).
13 pages, 2 figures