2000 character limit reached
The second generalized Hamming weight of some evaluation codes arising from a projective torus
Published 19 Nov 2016 in cs.IT, math.AC, math.AG, math.IT, and math.NT | (1611.06405v2)
Abstract: In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete bipartite graph. Also, at the beginning, we obtain some results about the generalized Hamming weights of some evaluation codes arising from a complete intersection when the minimum distance is known and they are non--degenerate codes. Finally we give an example where we use these results to determine the complete weight hierarchy of some 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.
