Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes

Details Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes

2012-03-28

arxiv.org/abs/1203.6129v2

Computer Science

Information Theory

article.cls, 12 pages, no figure. This is an expanded journal paper version of Section 3 of the previous conference paper arXi

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271681