Computational and Algorithmic Problems in Finite Fields

✍ Scribed by Igor E. Shparlinski (auth.)

Publisher: Springer Netherlands
Year: 1992
Tongue: English
Leaves: 252
Series: Mathematics and Its Applications (Soviet Series) 88
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Front Matter....Pages i-xii
Introduction....Pages 1-6
Polynomial Factorization....Pages 7-20
Finding Irreducible and Primitive Polynomials....Pages 21-29
The Distribution of Irreducible and Primitive Polynomials....Pages 30-48
Bases and Computation in Finite Fields....Pages 49-71
Coding Theory and Algebraic Curves....Pages 72-98
Elliptic Curves....Pages 99-108
Recurrent Sequences in Finite Fields and Cyclic Linear Codes....Pages 109-121
Finite Fields and Discrete Mathematics....Pages 122-138
Congruences....Pages 139-152
Some Related Problems....Pages 153-160
Back Matter....Pages 161-240

✦ Subjects

Field Theory and Polynomials; Symbolic and Algebraic Manipulation; Theory of Computation

📜 SIMILAR VOLUMES

Computational and algorithmic problems i

📁 Computational and algorithmic problems in finite fields

✍ Shparlinski, Igor E 📂 Library 📅 1992 🏛 Springer Netherlands;Kluwer 🌐 English

This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of

Finite fields, coding theory, and advanc

📁 Finite fields, coding theory, and advances in communications and computing

✍ Gary L. Mullen, Peter Jau-Shyong Shiue 📂 Library 📅 1993 🏛 M. Dekker 🌐 English

The refereed proceedings of the First International Conference on Finite Fields, Coding Theory, and Advances in Communications and Computing. The volume aims to encourage interaction between the theoretical aspects of finite fields and applications in many areas including information theory.

Finite Fields: Theory, Applications, and

📁 Finite Fields: Theory, Applications, and Algorithms

✍ Mullen G.L., Shiue P.J.-S. (eds.) 📂 Library 📅 1994 🏛 AMS 🌐 English

Because of their applications in so many diverse areas, finite fields continue to play increasingly important roles in various branches of modern mathematics, including number theory, algebra, and algebraic geometry, as well as in computer science, information theory, statistics, and engineering. Co

D-Finite Functions (Algorithms and Compu

📁 D-Finite Functions (Algorithms and Computation in Mathematics, 30)

✍ Manuel Kauers 📂 Library 📅 2023 🏛 Springer 🌐 English

<p><span>Defined as solutions of linear differential or difference equations with polynomial coefficients, D-finite functions play an important role in various areas of mathematics. This book is a comprehensive introduction to the theory of these functions with a special emphasis on computer algebra

Finite Fields: Theory, Applications, and

📁 Finite Fields: Theory, Applications, and Algorithms : Fourth International Conference on Finite Fields : Theory, Applications, and Algorithms August 12-15, 1997 univ

✍ Applications, and Algorithms (4th : 1997 : University of Waterloo) International 📂 Library 📅 1999 🏛 Amer Mathematical Society 🌐 English

The Fourth International Conference on 'Finite Fields: Theory, Applications, and Algorithms' was held at the University of Waterloo in August 1997. This volume presents the refereed proceedings. Because of its applications in so many diverse areas, finite fields continues to grow in importance in mo

Finite Fields for Computer Scientists an

📁 Finite Fields for Computer Scientists and Engineers

✍ Robert J. McEliece (auth.) 📂 Library 📅 1987 🏛 Springer US 🌐 English

<p>This book developed from a course on finite fields I gave at the University of Illinois at Urbana-Champaign in the Spring semester of 1979. The course was taught at the request of an exceptional group of graduate students (includ ing Anselm Blumer, Fred Garber, Evaggelos Geraniotis, Jim Lehnert,