A study of the efficiency, error-correcting capabilities, and limitations of graph theoretic block codes is presented. Aug-mentation of graph theoretic codes and their generation is discussed. It is shown that such augmentation techniques can substantially increase the level of efficiency of these codes and potentially could increase it to the level of the best available codes. Furthermore, the augmented graph theoretic codes are shown to be easily decodable
The growing popularity of a class of linear block codes called the low-density parity-check (LDPC) c...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
Key to the success of modern error correcting codes is the effectiveness of message-passing iterativ...
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...
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, an...
We look at graphical descriptions of block codes known as trellises, which illustrate connections be...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
We are undergoing a revolution in data. The ever-growing amount of information in our world has crea...
In order to meet the demands of data-hungry applications, modern data storage systems are expected t...
A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is use...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, a...
In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic...
The growing popularity of a class of linear block codes called the low-density parity-check (LDPC) c...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
Key to the success of modern error correcting codes is the effectiveness of message-passing iterativ...
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...
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, an...
We look at graphical descriptions of block codes known as trellises, which illustrate connections be...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
We are undergoing a revolution in data. The ever-growing amount of information in our world has crea...
In order to meet the demands of data-hungry applications, modern data storage systems are expected t...
A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is use...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, a...
In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic...
The growing popularity of a class of linear block codes called the low-density parity-check (LDPC) c...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
Key to the success of modern error correcting codes is the effectiveness of message-passing iterativ...
DOI
Add to ORKG