AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m,n) for 3≤m<n and show that permutation decoding can be used for full error-correction for these codes by finding explicit information sets and PD-sets for these information sets
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
AbstractBy finding explicit PD-sets we show that permutation decoding can be used for the binary cod...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
For a set Ω = f1; 2; : : : ; ng where n = 2k 6; let Ω fkg denote the set of all subsets of Ω of siz...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
AbstractWe examine the p-ary linear codes from incidence matrices of the three uniform subset graphs...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
AbstractBy finding explicit PD-sets we show that permutation decoding can be used for the binary cod...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
For a set Ω = f1; 2; : : : ; ng where n = 2k 6; let Ω fkg denote the set of all subsets of Ω of siz...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
AbstractWe examine the p-ary linear codes from incidence matrices of the three uniform subset graphs...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
The paper surveys some constructions of linear binary codes defined by the adjacency matrices of und...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
DOI
Add to ORKG