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).
Author supplied keywords
Cite
CITATION STYLE
APA
Bailey, R. F., & Yero, I. G. (2019). Error-correcting codes from k-resolving sets. Discussiones Mathematicae - Graph Theory, 39(1), 341–355. https://doi.org/10.7151/dmgt.2087
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free