AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller codes R¯(1,4) and R¯(1,5) and for the codes related to the Klein quadric KQ of PG(5,2) and to the Schubert subvariety of KQ
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
Permutation decoding is a technique that strongly depends on the existence of a special subset, call...
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on l...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the auto...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
International audienceThe classical generalized Reed-Muller codes introduced by Kasami, Lin and Pete...
Codes arising from Grassmannians have been widely investigated, both as generalization of Reed--Mull...
In this paper we investigate linear error correcting codes and projective caps related to the Gras...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
Permutation decoding is a technique that strongly depends on the existence of a special subset, call...
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on l...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the auto...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
International audienceThe classical generalized Reed-Muller codes introduced by Kasami, Lin and Pete...
Codes arising from Grassmannians have been widely investigated, both as generalization of Reed--Mull...
In this paper we investigate linear error correcting codes and projective caps related to the Gras...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
DOI
Add to ORKG