I have the equation AX * C = AXB
where all of the variables are square gf matrices of size n and the values are 0 or 1. AXB and AX are known, while C should be solved to B or an equivalent of it (there should be multiple solutions). Because X most likely isn´t regular (rank < n) not all of the variables in C can be calculated and i have to guess the rest after solving.
Question is: Can Matlab solve this equation (as far as possible), and in a better way than "manually" splitting the equation into n^2 equations?
I already tried to tell matlab that C is a symbol of, let´s say [8,8] and to solve AX*C==AXB
, but solve doesn´t seem to work with galois fields.
Any hints on how to do this would be appreciated.