2000 character limit reached
Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes (1203.6129v5)
Published 28 Mar 2012 in cs.IT, cs.SC, math.AC, math.AG, and math.IT
Abstract: We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. Our generalization enables us to apply the fast algorithm to compute a Gr\"obner basis of a module proposed by Lee and O'Sullivan, which was not possible in another generalization by Lax.