| dc.contributor.author | Bailey, Robert F. | |
| dc.contributor.author | González Yero, Ismael | |
| dc.contributor.other | Matemáticas | en_US |
| dc.date.accessioned | 2019-11-06T11:13:09Z | |
| dc.date.available | 2019-11-06T11:13:09Z | |
| dc.date.issued | 2019 | |
| dc.identifier.issn | 1234-3099 | |
| dc.identifier.issn | 2083-5892 | |
| dc.identifier.uri | http://hdl.handle.net/10498/21882 | |
| dc.description.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). | en_US |
| dc.format | application/pdf | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | UNIV ZIELONA GORA | en_US |
| dc.source | Discussiones Mathematicae Graph Theory 39 (2019) 341–355 | en_US |
| dc.subject | error-correcting code, k-resolving set | en_US |
| dc.subject | k-metric dimension | en_US |
| dc.subject | covering design | en_US |
| dc.subject | uncovering, grid graph | en_US |
| dc.title | Error-Correcting codes fromk-resolving sets | en_US |
| dc.type | journal article | en_US |
| dc.rights.accessRights | open access | en_US |
| dc.identifier.doi | 10.7151/dmgt.2087 | |