Loading…
On the generalized Hamming weights of certain Reed-Muller-type codes
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...
Saved in:
Published in: | arXiv.org 2019-07 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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 \(\mathbb{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 \(\mathbb{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 \(\mathbb{X}\) and their dual codes. |
---|---|
ISSN: | 2331-8422 |