2000 character limit reached
Evaluation codes and their basic parameters
Published 30 Jul 2019 in math.AC, cs.IT, math.AG, math.CO, math.IT, and math.NT | (1907.13217v5)
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.
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.