%0 Journal Article 
%A Bailey, Robert F.
%A González Yero, Ismael
%T Error-Correcting codes fromk-resolving sets
%D 2019
%@ 1234-3099

%U http://hdl.handle.net/10498/21882
%X 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).
%K error-correcting code, k-resolving set
%K k-metric dimension
%K covering design
%K uncovering, grid graph
%~ Universidad de Cádiz