|ECE4253 Digital Communications|
|Department of Electrical and Computer Engineering - University of New Brunswick, Fredericton, NB, Canada|
See addition and multiplication tables.
Binary values expressed as polynomials in GF(2m) can readily be manipulated using the definition of this finite field. Addition operations take place as bitwise XOR on m-bit coefficients. Multiplication is defined modulo P(x), where P(x) is a primitive polynomial of degree m. This online tool serves as a polynomial calculator in GF(2m).
Select input polynomials as decimal coefficients separated by spaces and a P(x) defining GF(2m).
Multiplication in GF(8), based on P(x) = x3 + x + 1
2019-11-14 01:41:28 AST
Last Updated: 2013-02-17
|Richard Tervo [ email@example.com ]||Back to the course homepage...|