8 search results - page 1 / 2 » Algebraic-Geometry Codes |
AAECC
1997
Springer
14 years 22 days 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...
TIT
2008
13 years 8 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
CORR
2010
Springer
13 years 8 months 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...
DCC
2010
IEEE
13 years 3 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...
IMA
2009
Springer
14 years 3 months ago
2009
Springer
