We determine information sets for the generalized Reed–Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields
It is shown that for n≥5 and r≤n−12, if an (n,M,2r+1) binary code exists, then the rth-order Reed–Mu...
It is shown that for n≥5 and r≤n−12, if an (n,M,2r+1) binary code exists, then the rth-order Reed–Mu...
This work develops codes suitable for iterative decoding using the sum-product algorithm. We conside...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
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...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decodi...
We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decodi...
It is shown that for n≥5 and r≤n−12, if an (n,M,2r+1) binary code exists, then the rth-order Reed–Mu...
It is shown that for n≥5 and r≤n−12, if an (n,M,2r+1) binary code exists, then the rth-order Reed–Mu...
This work develops codes suitable for iterative decoding using the sum-product algorithm. We conside...
We determine information sets for the generalized Reed–Muller codes and use these to apply partial p...
AbstractWe determine information sets for the generalized Reed–Muller codes and use these to apply p...
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...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
Codes defined through the row-span over finite fields of incidence matrices of designs have many pro...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), ...
We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decodi...
We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decodi...
It is shown that for n≥5 and r≤n−12, if an (n,M,2r+1) binary code exists, then the rth-order Reed–Mu...
It is shown that for n≥5 and r≤n−12, if an (n,M,2r+1) binary code exists, then the rth-order Reed–Mu...
This work develops codes suitable for iterative decoding using the sum-product algorithm. We conside...
DOI
Add to ORKG