363 search results - page 1 / 73 » Code Generation for Polynomial Multiplication |
CASC
2009
Springer
14 years 1 days ago
2009
Springer
We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and sho...
TCOM
2008
13 years 5 months ago
2008
All binary polynomials of degree up to 10 which are suitable to be used as generator polynomials of CRC codes are classified and all the necessary data for the evaluation of the e...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
TIT
2008
13 years 5 months ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
AAECC
2007
Springer
13 years 5 months ago
2007
Springer
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...