AbstractBy finding explicit PD-sets we show that permutation decoding can be used for the binary code obtained from an adjacency matrix of the triangular graph T(n) for any n≥5
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
AbstractFor integers n≥1,k≥0, and k≤n, the graph Γnk has vertices the 2n vectors of F2n and adjacenc...
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...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
For a set Ω = f1; 2; : : : ; ng where n = 2k 6; let Ω fkg denote the set of all subsets of Ω of siz...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
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...
AbstractWe examine the p-ary linear codes from incidence matrices of the three uniform subset graphs...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
AbstractFor integers n≥1,k≥0, and k≤n, the graph Γnk has vertices the 2n vectors of F2n and adjacenc...
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...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
For a set Ω = f1; 2; : : : ; ng where n = 2k 6; let Ω fkg denote the set of all subsets of Ω of siz...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
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...
AbstractWe examine the p-ary linear codes from incidence matrices of the three uniform subset graphs...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
AbstractFor integers n≥1,k≥0, and k≤n, the graph Γnk has vertices the 2n vectors of F2n and adjacenc...
DOI
Add to ORKG