In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective planes PG(2, q), where q = 2(h) and 5 <= h <= 9. We also construct 3-PD-sets of 75 elements for the code from the Desarguesian projective plane PG(2, q), where q = 2(9). These 2-PD-sets and 3-PD-sets can be used for partial permutation decoding of codes obtained from the Desarguesian projective planes
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
In this paper, we study the p-ary linear code C(PG(n,q)), q = p(h), p prime, h >= 1, generated by th...
In this paper, we study the p-ary linear code C(PG(n,q)), q = p(h), p prime, h >= 1, generated by th...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
In this paper, we study the $p$-ary linear code $C(PG(n,q))$, $q=p^h$, $p$ prime, $h\geq 1$, generat...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
AbstractConsider the natural action of PGL3(q) on the projective plane PG2(q) over a finite field GF...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
In this paper, we study the p-ary linear code C(PG(n,q)), q = p(h), p prime, h >= 1, generated by th...
In this paper, we study the p-ary linear code C(PG(n,q)), q = p(h), p prime, h >= 1, generated by th...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
In this paper, we study the $p$-ary linear code $C(PG(n,q))$, $q=p^h$, $p$ prime, $h\geq 1$, generat...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
AbstractConsider the natural action of PGL3(q) on the projective plane PG2(q) over a finite field GF...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point s...