Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Finite field arithmetic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Addition and subtraction== Addition and subtraction are performed by adding or subtracting two of these polynomials together, and reducing the result modulo the characteristic. In a finite field with characteristic 2, addition modulo 2, subtraction modulo 2, and XOR are identical. Thus, {| class="wikitable" |- ! Polynomial | (''x''<sup>6</sup> + ''x''<sup>4</sup> + ''x'' + 1) + (''x''<sup>7</sup> + ''x''<sup>6</sup> + ''x''<sup>3</sup> + ''x'') = ''x''<sup>7</sup> + ''x''<sup>4</sup> + ''x''<sup>3</sup> + 1 |- ! Binary | {01010011} + {11001010} = {10011001} |- ! Hexadecimal | {53} + {CA} = {99} |} Under regular addition of polynomials, the sum would contain a term 2''x''<sup>6</sup>. This term becomes 0''x''<sup>6</sup> and is dropped when the answer is reduced modulo 2. Here is a table with both the normal algebraic sum and the characteristic 2 finite field sum of a few polynomials: {| class="wikitable" |- ! rowspan=2 | ''p''<sub>1</sub> ! rowspan=2 | ''p''<sub>2</sub> ! colspan=2 | ''p''<sub>1</sub> + ''p''<sub>2</sub> under... |- ! [[Polynomial ring|K[''x'']]] ! GF(2<sup>''n''</sup>) |- | ''x''<sup>3</sup> + ''x'' + 1 | ''x''<sup>3</sup> + ''x''<sup>2</sup> | 2''x''<sup>3</sup> + ''x''<sup>2</sup> + ''x'' + 1 | ''x''<sup>2</sup> + ''x'' + 1 |- | ''x''<sup>4</sup> + ''x''<sup>2</sup> | ''x''<sup>6</sup> + ''x''<sup>2</sup> | ''x''<sup>6</sup> + ''x''<sup>4</sup> + 2''x''<sup>2</sup> | ''x''<sup>6</sup> + ''x''<sup>4</sup> |- | ''x'' + 1 | ''x''<sup>2</sup> + 1 | ''x''<sup>2</sup> + ''x'' + 2 | ''x''<sup>2</sup> + ''x''</tr> |- | ''x''<sup>3</sup> + ''x'' | ''x''<sup>2</sup> + 1 | ''x''<sup>3</sup> + ''x''<sup>2</sup> + ''x'' + 1 | ''x''<sup>3</sup> + ''x''<sup>2</sup> + ''x'' + 1 |- | ''x''<sup>2</sup> + ''x'' | ''x''<sup>2</sup> + ''x'' | 2''x''<sup>2</sup> + 2''x'' | 0 |} In computer science applications, the operations are simplified for finite fields of characteristic 2, also called GF(2<sup>''n''</sup>) [[Galois field]]s, making these fields especially popular choices for applications.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)