The second generalized Hamming weight of some evaluation codes arising from a projective torus

Manuel González Sarabia, Eduardo Camps, Eliseo Sarmiento, Rafael H. Villarreal

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

In this paper we give a formula for the second generalized Hamming weight of certain evaluation codes arising from a projective torus. This allows us to compute the corresponding weights of the codes parameterized by the edges of a complete bipartite graph. We determine some of the generalized Hamming weights of non-degenerate evaluation codes arising from a complete intersection in terms of the minimum distance, the degree and the a-invariant. It is shown that the generalized Hamming weights and the minimum distance have some similar behavior for parameterized codes These results are used to find the complete weight hierarchy of some codes.

Original languageEnglish
Pages (from-to)370-394
Number of pages25
JournalFinite Fields and their Applications
Volume52
DOIs
StatePublished - Jul 2018

Keywords

  • Complete intersection
  • Evaluation code
  • Generalized Hamming weight
  • Parameterized code

Fingerprint

Dive into the research topics of 'The second generalized Hamming weight of some evaluation codes arising from a projective torus'. Together they form a unique fingerprint.

Cite this