Back to Search
Start Over
Generalization of the Lee–OʼSullivan list decoding for one-point AG codes.
- Source :
-
Journal of Symbolic Computation . Aug2013, Vol. 55, p1-9. 9p. - Publication Year :
- 2013
-
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). [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 55
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 89032137
- Full Text :
- https://doi.org/10.1016/j.jsc.2013.03.001