Error-Correcting Codes from k-Resolving Sets

Error-Correcting Codes from k-Resolving Sets

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).

Bibliographic Details
Main Authors: Bailey Robert F., Yero Ismael G.
Format: Article
Language:English
Published: Sciendo 2019-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
error-correcting code
k-resolving set
k-metric dimension
covering design
uncovering
grid graph
05c12
94b25
05b40
94b35
Online Access:https://doi.org/10.7151/dmgt.2087

Internet

https://doi.org/10.7151/dmgt.2087

Similar Items