Multiplication of two matrices ? one in GF(2) other in R

ait.abd
Messages
24
Reaction score
0

Homework Statement


H is a nxn matrix with elements in {0,1}
G is a nxn matrix with elements in GF(2)
m is a nx1 vector with elements in GF(2).
How can we perceive the output of
HGm where Gm multiplication is in GF(2) and H multiplication is a normal real multiplication.
Actually I want to combine HG transformation into one P transformation. How can I multiply two matrices while elements in one is in GF(2) and other is in R ?
(We can also restrict the entries in H to be one of 0 and 1 but the output can be in R).


Homework Equations





The Attempt at a Solution


 
Physics news on Phys.org
the entries in the vector Gm will still be in GF(2) = {0,1}.

so basically the vector Gm acts as a "choice function" picking out which columns of H get summed in the ouput, which will be a real-valued vector.

it makes more sense to do it this way, than to imagine what "HG" means (in this case G acts in a more complicated way, which is then subjected to another selection via m).

in general, (HG)m and H(Gm) won't yield the same results:

[a b]([1 0][1])
[c d]([1 1][1]) =

[a b][1]
[c d][0], which is (a,c)

([a b][1 0])[1]
([c d][1 1])[1] =

[a+b b][1]
[c+d d][1] = (a+2b,c+2d), which is only equal to the first mod 2.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top