Sciweavers

DCC
2010
IEEE
13 years 2 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
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...
Nathan Drake, Gretchen L. Matthews
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
On the order bound for one-point AG codes
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...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
AAECC
1997
Springer
113views Algorithms» more  AAECC 1997»
13 years 11 months ago
Order Functions and Evaluation Codes
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...
Tom Høholdt, Jacobus H. van Lint, Ruud Pell...