Can someone point me to literature describing the existence or better
yet an algorithm for computing the singular value decomposition (SVD)
of a matrix with elements in GF(2^N) (galois field).
I'm also interested in any reference that discuss algorithms to solve
a quadratic form x^TAx = c where x's elements are in GF(2) and A's
elements are in GF(2^N). In my case A is lower triangler - you can't
make it symmetric in GF(2^N).
___o Cyber Rights Now: Accept No Compromise.
_ \ <,_ imaging away / M. Flickner, flick@almaden.ibm.com (408)
927-1776
(_)/ (_) IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120-6099
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 113 |
Nodes: | 8 (1 / 7) |
Uptime: | 174:21:34 |
Calls: | 2,506 |
Files: | 8,706 |
Messages: | 1,933,295 |