Comment on "An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve"
IEEE Transactions on Computers
Some Comments on the Fast Hadamard Transform of Order Twelve
IEEE Transactions on Computers
Encrypting by random rotations
Proceedings of the 1982 conference on Cryptography
| Hi-index | 14.99 |
a matrix factorization is presented for a Hadamard matrix of order twelve that permits a Hadamard transform of this order to be computed with substantially fewer operations than by simple matrix multiplication. The matrix factorization is extended to Hadamard matrices of order 2nX 12 where n is an integer.