DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
CORR
2010
Springer
14 years 25 days ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
AAECC
1997
Springer
14 years 4 months ago
1997
Springer
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geo...