A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
2008
IEEE Transactions on Information Theory
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 of f modulo 6 is polynomial f + 2g + 3h, where no two of g, f and h have common monomials. Using this representation, some surprising applications are described: it is shown that n homogeneous linear polynomials x1, x2, . . . , xn can be linearly transformed to n o(1) linear polynomials, such that from these linear
doi:10.1109/tit.2008.926346
fatcat:qvvq7tkz7zhgzederxpkkiopae