Evaluation codes and their basic parameters
Preprint
Abstract
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of Reed--Muller-type codes, and we determine the minimum distance of toric codes over hypersimplices, and the 1st and 2nd generalized Hamming weights of squarefree evaluation codes.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Linear codes over signed graphsDesigns, Codes and Cryptography, 2019
- Generalized minimum distance functionsJournal of Algebraic Combinatorics, 2018
- A note on the generalized Hamming weights of Reed–Muller codesApplicable Algebra in Engineering, Communication and Computing, 2018
- Projective Nested Cartesian CodesBulletin of the Brazilian Mathematical Society, New Series, 2016
- Computational Linear and Commutative Algebra2016
- Affine cartesian codesDesigns, Codes and Cryptography, 2012
- Reed-Muller-Type Codes Over the Segre VarietyFinite Fields and Their Applications, 2002
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Hilbert functions of graded algebrasAdvances in Mathematics, 1978
- The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)Discrete Mathematics, 1977