2000 character limit reached
On the geometry of small weight codewords of dual algebraic geometric codes
Published 7 Apr 2011 in math.AG, cs.IT, and math.IT | (1104.1320v1)
Abstract: We investigate the geometry of the support of small weight codewords of dual algebraic geometric codes on smooth complete intersections by applying the powerful tools recently developed by Alain Couvreur. In particular, by restricting ourselves to the case of Hermitian codes, we recover and extend previous results obtained by the second named author joint with Marco Pellegrini and Massimiliano Sala.
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.