List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes

Details List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes

2012-01-30

arxiv.org/abs/1201.6248v4

Computer Science

Information Theory

IEEEtran.cls, 5 pages, no figure. To appear in Proc. 2012 IEEE International Symposium on Information Theory, July 1-6, 2012,

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. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya $C_{ab}$ curves proposed by Lee, Bras-Amor\'os and O'Sullivan to general one-point AG codes, without any assumption. Finally we extend the latter unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil that has not been done in the original proposal, and remove the unnecessary computational steps so that it can run faster.

Affiliated with

Also associated with

No associations

Rating

List Decoding Algorithms based on Groebner Bases for General 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 List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List Decoding Algorithms based on Groebner Bases for General One-Point AG Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359819