Linked from

The 51 pages that link to Finite field, each with the reason it gives.

• Error-correcting codeNarrower topic: Many practical codes perform their arithmetic over finite fields.

• Elliptic-curve cryptographyNarrower topic: Curve coordinates and arithmetic are computed in a finite field.

• Reed–Solomon codeNarrower topic: Reed–Solomon symbols and polynomial coefficients are elements of a finite field.

• Coding theoryNarrower topic: Many algebraic codes perform their calculations over finite fields.

• Discrete logarithmNarrower topic: Many classic discrete logarithm systems use the multiplicative group of a finite field.

• Gaussian binomial coefficientNarrower topic: The coefficient counts subspaces over these fields, whose size supplies its parameter.

• Weil conjecturesNarrower topic: The conjectures concern varieties defined over fields of this kind.

• AESNarrower topic: AES performs key parts of its byte arithmetic in a finite field.

• Gilbert–Varshamov boundNarrower topic: The q-ary form counts strings over an alphabet whose size is a prime power.

• Reed–Solomon error correctionNarrower topic: Reed–Solomon symbols are field elements, so their arithmetic wraps around a finite set.

• Artin's conjecture on primitive rootsNarrower topic: Nonzero elements of a prime field form the group in which primitive roots operate.

• Chevalley–Warning theoremNarrower topic: The theorem’s divisibility conclusion uses the characteristic of this field.

• Hasse's theorem on elliptic curvesNarrower topic: The theorem's parameter q is the number of elements in this field.

• Schinzel's theoremNarrower topic: Each prime in the theorem supplies a finite field in which the polynomial has a root.