@misc{10498/21882,
year = {2019},
url = {http://hdl.handle.net/10498/21882},
abstract = {We demonstrate a construction of error-correcting codes from graphs by
means of k-resolving sets, and present a decoding algorithm which makes use
of covering designs. Along the way, we determine the k-metric dimension of
grid graphs (i.e., Cartesian products of paths).},
publisher = {UNIV ZIELONA GORA},
keywords = {error-correcting code, k-resolving set},
keywords = {k-metric dimension},
keywords = {covering design},
keywords = {uncovering, grid graph},
title = {Error-Correcting codes fromk-resolving sets},
doi = {10.7151/dmgt.2087},
author = {Bailey, Robert F. and González Yero, Ismael},
}