1 Apr
2016
1 Apr
'16
5:46 p.m.
On 4/1/16, Warren D Smith <warren.wds@gmail.com> wrote:
Be nice if one could create an NxN bit-matrix (for example N=machine's wordsize) and then multiply it (mod 2) by an N-element bit vector (e.g machine word) in 1 instruction.
This would help with cryptography, error correcting codes, and probably a lot of other stuff.
--such as permuting bits in a word, would be another application. Also, if the XORs that were used to add up the sums mod 2, were replaced by plain ORs, then that other kind of matrix-vector "multiply" would be excellent for graph connectivity calculations.