Error-Correcting codes fromk-resolving sets

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/21882

DOI: 10.7151/dmgt.2087

ISSN: 1234-3099

ISSN: 2083-5892

Files
Statistics
Metrics and citations
 
Share
Export
EndNoteBibTexRIS
Metadata
Show full item record
Author/s
Bailey, Robert F.; González Yero, IsmaelAuthority UCA
Date
2019
Department
Matemáticas
Source
Discussiones Mathematicae Graph Theory 39 (2019) 341–355
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).
Subjects
error-correcting code, k-resolving set; k-metric dimension; covering design; uncovering, grid graph
Collections