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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. F. Assmus, Jr. and J. D. Key, Designs and Their Codes, Cambridge University Press, Cambridge (1992).
J. Ax, Zeros of polynomials over finite fields, American Journal of Mathematics, Vol. 86 (1964) pp. 255–261.
G. Lachaud, Projective Reed-Muller codes, in Coding Theory and Applications, Proc. 2nd Int. Colloq., Paris 1986, Lecture Notes in Computer Science 311, Springer, Berlin (1988) pp. 125–129.
G. Lachaud, The parameters of projective Reed-Muller codes, Discrete Mathematics, Vol. 81, No. 2 (1990) pp. 217–221.
A. B. Sørensen, Projective Reed-Muller codes, IEEE Transactions on Information Theory, Vol. 37, No. 6 (1991) pp. 1567–1576.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boner, C. Maximal Weight Divisors of Projective Reed-Muller Codes. Designs, Codes and Cryptography 24, 43–47 (2001). https://doi.org/10.1023/A:1011221229549
Issue Date:
DOI: https://doi.org/10.1023/A:1011221229549