Computational and Algorithmic Problems in Finite Fields

ISBN-13: 9780792320579 / Angielski / Twarda / 1992 / 240 str.

Igor E. Shparlinski; I. E. Shparlinski

Opis

This volume presents an exhaustive treatment of computation and algorithms for finite fields.

Spis treści

Series Editor's Preface. Preface. Notations. Introduction. 1. Polynomial Factorization. 2. Finding Irreducible and Primitive Polynomials. 3. The Distribution of Irreducible and Primitive Polynomials. 4. Bases and Computation in Finite Fields. 5. Coding Theory and Algebraic Curves. 6. Elliptic Curves. 7. Recurrent Sequences in Finite Fields and Linear Cyclic Codes. 8. Finite Fields and Discreate Mathematics. 9. Congruences. 10. Some Related Problems. Appendix 1. Appendix 2. Appendix 3. Addendum. References. Index.