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).
SCImago Journal Rank (SJR) 2018: 0.763 Source Normalized Impact per Paper (SNIP) 2018: 0.934
Mathematical Citation Quotient (MCQ) 2017: 0.36
researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs