research

Error-Correcting codes fromk-resolving sets

Authors
Publication date
1 January 2019
Publisher
'Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora'
Doi

    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)

      Similar works

      Full text

      thumbnail-image

      Available Versions

      RODIN - Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz

      redirect
      oaioai:rodin.uca.es:10498/21882
      Last time updated on 17/04/2020

      Directory of Open Access Journals

      redirect
      oaioai:doaj.org/article:080b23c34...
      Last time updated on 03/06/2019

      Crossref

      redirect
      oaiinfo:doi/10.7151%2Fdmgt.2087
      Last time updated on 18/12/2020

      Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz

      redirect
      oaioai:rodin.uca.es:10498/21882
      Last time updated on 06/12/2019