Maximal Weight Divisors of Projective Reed-Muller Codes

  • Authors:

  • Chris Boner

  • Affiliations:

  • Denison University, Department of Math. and Computer Science, Granville, OH 43023

  • Venue:
  • Designs, Codes and Cryptography
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Projective Reed-Muller (PRM) codes, as the name suggests, are the projective analogues of generalized Reed-Muller codes. The parameters are known, and small steps have been taken towards pinning down the codeword weights that occur in any PRM code. We determine, for any PRM code, the greatest common divisor of its codeword weights.