25 search results - page 4 / 5 » Algorithms for polynomial GCD computation over algebraic fun... |
112
click to vote
ADG
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
118
click to vote
STOC
2010
ACM
16 years 7 days ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
123
click to vote
DCC
2010
IEEE
14 years 9 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...
139
click to vote
ANTS
2010
Springer
15 years 6 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
122
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...