2000 character limit reached
Relative generalized Hamming weights of evaluation codes
Published 14 Dec 2021 in cs.IT, math.AC, and math.IT | (2112.07085v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
