202 search results - page 4 / 41 » Algebra and Geometry |
DCC
2010
IEEE
13 years 2 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...
DIMACS
2001
13 years 8 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
TIT
2008
13 years 7 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...
ACS
2007
13 years 7 months ago
2007
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduce...
DIMACS
2001
13 years 8 months ago
2001
Let C be a smooth real plane curve. Let c be its degree and g its genus. We assume that C has at least g real branches. Let d be a nonzero natural integer strictly less than c. Let...