Abstract
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and OʼSullivan (2009) based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander (2010). Our generalization enables us to apply the fast algorithm to compute a Gröbner basis of a module proposed by Lee and OʼSullivan (2009), which was not possible in another generalization by Lax (2012).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
