Error-Correcting Codes from k-Resolving Sets
R. A. Bailey, Ismael G. Yero · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2019
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).