I have to create a procedure that decodes an encoded message using a 2x2 matrix and a row vector. (Alphanumeric is a 95 character string)
So far I have A:=Matrix(2, 2, [[17,22], [4, 53]]); B:=Vector[row]([19,82]); as my two matricies, and have writtten this as my proc:
This a sample program that I wrote which is supposed to test a function that I wrote "proj" to project a function onto a basis. In particular, in this example I use a Fourier mode. When I project a function which is a sum of two terms I get an incorrect answer. When I project each term I get the correct answer.
Any ideas why this yielding an inconsistent result? Also, if maple has it's own version of proj that is more stable I'm happy to use that.
For a given galois field, suppose there is such a polynomial function mapping from GF(q) to GF(q):
I can use x^q-x=0 to "reduce" it to such the following form:
now, the problem is whether this is the only method (x^q-x=0) to reduce a polynomial function mapping from GF(q) to GF(q)?
Thanks a lot.
|First 777 778 779 780 781 782 783 Last||Page 779 of 1064|
Please log-in to your MaplePrimes account.
Wrong Email/Password. Please try again.
|Automatically sign in on future visits|