Error-correcting codes from k-resolving sets
classification
🧮 math.CO
keywords
codeserror-correctinggraphsresolvingsetsalgorithmalongcartesian
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.