Error-correcting codes from k-resolving sets


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). MSC 2010: 05C12, 94B25 (primary); 05B40, 94B35 (secondary).

2 Figures and Tables

Cite this paper

@inproceedings{Bailey2017ErrorcorrectingCF, title={Error-correcting codes from k-resolving sets}, author={Robert F. Bailey and Ismael Gonz{\'a}lez Yero}, year={2017} }