๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computer description of finite fields

โœ Scribed by Yu. P. Vasil'ev

Publisher
Springer US
Year
1980
Tongue
English
Weight
296 KB
Volume
15
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The computer construction of matrix repr
The computer construction of matrix representationsof finite groups over finite fields
โœ R.A. Parker; R.A. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 517 KB

Given an abstract group G it is important to be able to find explicit generators for a concrete group isomorphic to G, in order to perform calculations with the group. In this paper we describe a method of using the "Meat-axe" to construct explicit matrix generators for a given group.

Idempotent Computation over Finite Field
Idempotent Computation over Finite Fields
โœ Richard A. Davis ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 738 KB

In this paper, we provide an account of several new techniques for computing the primitive idempotents of a commutative artinian algebra over a finite field. Examples of such algebras include the center of a finite group algebra or any finite dimensional quotient of a polynomial ring. The computatio

Explicit Computation of Isomorphisms bet
Explicit Computation of Isomorphisms between Finite Fields
โœ Bill Allombert ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 132 KB

Although it is easy to prove that two finite fields having the same cardinality are isomorphic, the proof uses embeddings into an algebraic closure (or at least into a common overfield), hence is not constructive, and so does not provide explicit isomorphisms. We give algorithms to solve this proble