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

Computation with finite fields

โœ Scribed by Thomas C. Bartee; David I. Schneider

Book ID
114036433
Publisher
Elsevier Science
Year
1963
Weight
838 KB
Volume
6
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

R64-49 Computation with Finite Fields
R64-49 Computation with Finite Fields
โœ Booth, T.L. ๐Ÿ“‚ Article ๐Ÿ“… 1964 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 593 KB
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