Relative generalized Hamming weights of evaluation codes
Information Theory
2024-02-07 v1 Commutative Algebra
math.IT
Abstract
The aim of this work is to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound. We prove that this bound can be sharp. We compute the next-to-minimal weight of toric codes over hypersimplices of degree 1.
Keywords
Cite
@article{arxiv.2112.07085,
title = {Relative generalized Hamming weights of evaluation codes},
author = {Delio Jaramillo-Velez and Hiram H. López and Yuriko Pitones},
journal= {arXiv preprint arXiv:2112.07085},
year = {2024}
}