Error-Correcting codes fromk-resolving sets
Metrics and citations
MetadataShow full item record
SourceDiscussiones Mathematicae Graph Theory 39 (2019) 341–355
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).