Error-correcting codes from $k$-resolving sets
Combinatorics
2017-08-29 v4
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).
Keywords
Cite
@article{arxiv.1605.03141,
title = {Error-correcting codes from $k$-resolving sets},
author = {Robert F. Bailey and Ismael G. Yero},
journal= {arXiv preprint arXiv:1605.03141},
year = {2017}
}
Comments
13 pages, 2 figures