DocumentCode :
891989
Title :
On the number of correctable errors for some AG-codes
Author :
Jensen, H. Elbrond ; Hoholdt, T. ; Justesen, J.
Author_Institution :
Tech. Univ. of Denmark, Lyngby, Denmark
Volume :
39
Issue :
2
fYear :
1993
fDate :
3/1/1993 12:00:00 AM
Firstpage :
681
Lastpage :
684
Abstract :
An algorithm that, for codes from a regular plane curve, corrects up to (d*/2)-(m2/8)+(m/4)-(9/8) errors, where d* is the designed distance and m is the degree of the curve, was presented in an earlier work (see ibid., vol.35, p.811-21, 1989). It is now shown that this bound is the best possible for the algorithm considered
Keywords :
algebra; decoding; error correction codes; geometry; algebraic-geometric codes; decoding; designed distance; error correction; number of correctable errors; regular plane curve; Decoding; Equations; Error correction; Error correction codes; Galois fields; Geometry; Helium; Parity check codes; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.212303
Filename :
212303
Link To Document :
بازگشت