363 search results - page 5 / 73 » Code Generation for Polynomial Multiplication |
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...
JSC
2011
12 years 10 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...