Remarks on second and third weights of Projective Reed-Muller codes

Abstract

Determining the weight distributions of the projective Reed-Muller codes is a very hard problem and has been studied extensively in the literature. In this article, we provide an alternative proof of the second weight of the projective Reed-Muller codes (d, m) where m 3 and 3 d q+32. We show that the second weight is attained by codewords that correspond to hypersurfaces containing a hyperplane under the hypothesis on d. Furthermore, we compute the second weight of (d, 2) for 3 d q-1. Furthermore, we give an upper bound for the third weight of (d, 2).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…