On the generalized Hamming weights of certain Reed-Muller-type codes

Abstract

There is a nice combinatorial formula of P. Beelen and M. Datta for the r-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the r-th generalized Hamming weight for a family of affine cartesian codes. If X is a set of projective points over a finite field we determine the basic parameters and the generalized Hamming weights of the Veronese type codes on X and their dual codes in terms of the basic parameters and the generalized Hamming weights of the corresponding projective Reed--Muller-type codes on X and their dual codes.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…