For m≥4m≥4 even, the duals of p-ary codes, for any prime p, from adjacency matrices for the m-ary 2-cube Qm2Q2m are shown to have subcodes with parameters [m2,2m−2,m][m2,2m−2,m] for which minimal PD-sets of size m2m2 are constructed, hence attaining the full error-correction capabilities of the code, and, as such, the most efficient sets for full permutation decoding.</p
We examine the p-ary codes from incidence matrices of Paley graphs P (q) where q ≡ 1 (mod 4) is a p...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
For m≥4m≥4 even, the duals of p-ary codes, for any prime p, from adjacency matrices for the m-ary 2-...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractWe examine the p-ary codes, for any prime p, that can be obtained from incidence matrices an...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
Permutation decoding is a technique that strongly depends on the existence of a special subset, call...
Please read abstract in the article.The National Research Foundation of South Africahttp://link.spri...
We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The construc...
>Magister Scientiae - MScFor integers n, k 2:: 1, and k ~ n, the graph r~has vertices the 2n vectors...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
We examine the p-ary codes from incidence matrices of Paley graphs P (q) where q ≡ 1 (mod 4) is a p...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
For m≥4m≥4 even, the duals of p-ary codes, for any prime p, from adjacency matrices for the m-ary 2-...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractWe examine the p-ary codes, for any prime p, that can be obtained from incidence matrices an...
AbstractThe paper surveys some constructions of linear binary codes defined by the adjacency matrice...
Permutation decoding is a technique that strongly depends on the existence of a special subset, call...
Please read abstract in the article.The National Research Foundation of South Africahttp://link.spri...
We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The construc...
>Magister Scientiae - MScFor integers n, k 2:: 1, and k ~ n, the graph r~has vertices the 2n vectors...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractBy finding explicit PD sets, we show that permutation decoding can be used for the binary co...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
We examine the p-ary codes from incidence matrices of Paley graphs P (q) where q ≡ 1 (mod 4) is a p...
AbstractWe examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. th...
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of ...
DOI
Add to ORKG