RT journal article
T1 Error-Correcting codes fromk-resolving sets
A1 Bailey, Robert F.
A1 González Yero, Ismael
A2 Matemáticas
K1 error-correcting code, k-resolving set
K1 k-metric dimension
K1 covering design
K1 uncovering, grid graph
AB We demonstrate a construction of error-correcting codes from graphs bymeans of k-resolving sets, and present a decoding algorithm which makes useof covering designs. Along the way, we determine the k-metric dimension ofgrid graphs (i.e., Cartesian products of paths).
PB UNIV ZIELONA GORA
SN 1234-3099
YR 2019
FD 2019
LK http://hdl.handle.net/10498/21882
UL http://hdl.handle.net/10498/21882
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 13-nov-2026