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(2^{m}) 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(2^{m}).

Select input polynomials as decimal coefficients separated by
spaces and a P(x) defining GF(2^{m}).

Multiplication in GF(8), based on P(x) = x^{3} + x + 1

1 | 0 | 7 | 6 | |||

× | 1 | 6 | 3 | |||

3 | 0 | 2 | 1 | |||

6 | 0 | 4 | 2 | 0 | ||

1 | 0 | 7 | 6 | 0 | 0 | |

= | 1 | 6 | 4 | 2 | 0 | 1 |

2023-03-29 09:19:53 ADT
Last Updated: 2013-02-17 |
Richard Tervo [ tervo@unb.ca ] | Back to the course homepage... |