AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian projective and affine planes. We define the notion of s-PD-sets to correct s errors, and construct some specific small sets for s=2 and 3 for desarguesian planes of prime order
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
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...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
In this paper we construct 2-PD-sets of 16 elements for codes from the Desarguesian projective plane...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes fro...
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...
AbstractWe generalize the notion of a PD-set of a code to that of a t-PD-set of an arbitrary permuta...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
Permutation decoding is a technique, developed by Jessie McWilliams in 1960\u27s. It involves findin...
AbstractWe examine the binary codes obtained from the row span over the field F2 of an adjacency mat...
DOI
Add to ORKG