Computer Science – Information Theory
Scientific paper
2010-02-25
Computer Science
Information Theory
Scientific paper
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [H. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields and their Applications 14 (2008), pp. 92-123]. Here we investigate in detail the application of that bound to one-point algebraic geometry codes, obtaining a bound $d^*$ for the minimum distance of these codes. We establish a connection between $d^*$ and the order bound and its generalizations. We also study the improved code constructions based on $d^*$. Finally we extend $d^*$ to all generalized Hamming weights.
Geil Olav
Munuera Carlos
Ruano Diego
Torres Fernando
No associations
LandOfFree
On the order bounds 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 On the order bounds for one-point AG codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the order bounds for one-point AG codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-379890