Christof Paar, “Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields”, Dissertation, Institute for Experimental Mathematics, Universität Essen, Germany, 1994.
Tagged: galois field Toggle Comment Threads | Keyboard Shortcuts
Have just finished reading Chapter 4 from “Finite Fields for Computer Scientists and Engineers – Robert J. McEliece”.
I’ve been away from the computer and spend the whole morning scribbling some calculation on constructing a field. Me now understand that when we have an Euclidean domain with for example , that is irreducible because and , so has no zeroes in .
But I’d like to post this tables here just for a quick reminder for me, it’s unfinished but I’ve got the idea so keeping it up here will be useful someday when I forgot about this stuff 😀
Move forward to Galois Field representation in C. Zooming in all the modules of math for polynomial representation with the prime number 2 as the modulus (means that the coefficient and only take values of 0 or 1).
The text converting code is halfway to go.
CG and yuti are discussing. Toggle Comments