Sciweavers

2 search results - page 1 / 1
» Modular Representations of Polynomials: Hyperdense Coding an...
Sort
View
TIT
2008
74views more  TIT 2008»
13 years 11 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
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 ...
Vince Grolmusz
JSC
2010
155views more  JSC 2010»
13 years 9 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan