Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science
Second highest number of points of hypersurfaces in Fqn
Finite Fields and Their Applications
On the Number of Points of Some Hypersurfaces in Fnq
Finite Fields and Their Applications
A note on the proof of a theorem of Katz
Finite Fields and Their Applications
On theorems of Delsarte---McEliece and Chevalley---Warning---Ax---Katz
Designs, Codes and Cryptography
The non-gap sequence of a subcode of a generalized Reed---Solomon code
Designs, Codes and Cryptography
Weighted Reed---Muller codes revisited
Designs, Codes and Cryptography
Second weight codewords of generalized Reed-Muller codes
Cryptography and Communications
| Hi-index | 754.84 |
First it is shown that all binary Reed-Muller codes with one digit dropped can be made cyclic by rearranging the digits. Then a natural generalization to the nonbinary case is presented, which also includes the Reed-Muller codes and Reed-Solomon codes as special cases. The generator polynomial is characterized and the minimum weight is established. Finally, some results on weight distribution are given.