DOIAbstract
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), where m>4 by finding s-PD-sets for these codes for 2≤s≤4
AbstractPartial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), where m>4 by finding s-PD-sets for these codes for 2≤s≤4
A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permu...
Abstract—The q-ary Reed–Muller (RM) codes RM (u;m) of length n = q are a generalization of Reed–Solo...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
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...
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...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
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 determine information sets for the generalized Reed–Muller codes and use these to apply p...
In this paper, s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary linea...
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...
A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permu...
Abstract—The q-ary Reed–Muller (RM) codes RM (u;m) of length n = q are a generalization of Reed–Solo...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
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...
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...
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permuta...
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 determine information sets for the generalized Reed–Muller codes and use these to apply p...
In this paper, s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary linea...
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...
A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permu...
Abstract—The q-ary Reed–Muller (RM) codes RM (u;m) of length n = q are a generalization of Reed–Solo...
AbstractWe determine to what extent permutation decoding can be used for the codes from desarguesian...
Add to ORKG