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)
An l-resolving set of a graph G is a set of vertices that has a unique array of distances to all ver...
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs ...
For an ordered setW = {w1,w2,...,wk} of vertices and a vertexv in a connected graphG, the code of v ...
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, a...
A study of the efficiency, error-correcting capabilities, and limitations of graph theoretic block c...
101 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We consider two graph-based t...
Error-correcting codes seek to address the problem of transmitting information efficiently and relia...
AbstractWe replace the usual setting for error-correcting codes (i.e. vector spaces over finite fiel...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
[Abstract] An ordered set S of vertices of a graph G is a resolving set for G if every vertex is uni...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
Array Codes form a class of Error Correcting Codes which are specifically designed to deal with natu...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
The version of record is available online at: http://dx.doi.org/10.1007/s00009-022-02096-1An ordered...
In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic...
An l-resolving set of a graph G is a set of vertices that has a unique array of distances to all ver...
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs ...
For an ordered setW = {w1,w2,...,wk} of vertices and a vertexv in a connected graphG, the code of v ...
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, a...
A study of the efficiency, error-correcting capabilities, and limitations of graph theoretic block c...
101 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We consider two graph-based t...
Error-correcting codes seek to address the problem of transmitting information efficiently and relia...
AbstractWe replace the usual setting for error-correcting codes (i.e. vector spaces over finite fiel...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
[Abstract] An ordered set S of vertices of a graph G is a resolving set for G if every vertex is uni...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
Array Codes form a class of Error Correcting Codes which are specifically designed to deal with natu...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
The version of record is available online at: http://dx.doi.org/10.1007/s00009-022-02096-1An ordered...
In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic...
An l-resolving set of a graph G is a set of vertices that has a unique array of distances to all ver...
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs ...
For an ordered setW = {w1,w2,...,wk} of vertices and a vertexv in a connected graphG, the code of v ...
DOI
Add to ORKG