2021
DOI: 10.48550/arxiv.2112.07085
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Relative generalized Hamming weights of evaluation codes

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 26 publications
(35 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?