Difference between revisions of "Galois fields"
From Conservapedia
(a start but needs work!) |
(link+clean up) |
||
| Line 1: | Line 1: | ||
| − | In [[mathematics]] a Galois Field is a field having a finite number of elements. | + | In [[mathematics]] a Galois Field is a [[Field (mathematics)|field]] having a finite number of elements. |
Galois fields are one of two types: | Galois fields are one of two types: | ||
| Line 6: | Line 6: | ||
*The polynomials with coefficients modulo a prime number ''p'' having operations modulo with an irreducible n-degree polynomial r(x), represented by F<sub>p^n</sub> | *The polynomials with coefficients modulo a prime number ''p'' having operations modulo with an irreducible n-degree polynomial r(x), represented by F<sub>p^n</sub> | ||
| − | A Galois field with q= | + | A Galois field with q=p^n elements is typically denoted by GF<sub>q</sub> or F<sub>q</sub>. |
[[category:mathematics]] | [[category:mathematics]] | ||
Revision as of 02:57, July 14, 2007
In mathematics a Galois Field is a field having a finite number of elements.
Galois fields are one of two types:
- The integers modulo a prime number p, represented by Zp
- The polynomials with coefficients modulo a prime number p having operations modulo with an irreducible n-degree polynomial r(x), represented by Fp^n
A Galois field with q=p^n elements is typically denoted by GFq or Fq.
