Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Finite Fields: Theory, Applications and Algorithms
 
Edited by: Ronald C. Mullin University of Waterloo, Waterloo, ON, Canada
Gary L. Mullen Pennsylvania State University, University Park, PA
Finite Fields: Theory, Applications and Algorithms
Softcover ISBN:  978-0-8218-0817-7
Product Code:  CONM/225
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7816-3
Product Code:  CONM/225.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-0817-7
eBook: ISBN:  978-0-8218-7816-3
Product Code:  CONM/225.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Finite Fields: Theory, Applications and Algorithms
Click above image for expanded view
Finite Fields: Theory, Applications and Algorithms
Edited by: Ronald C. Mullin University of Waterloo, Waterloo, ON, Canada
Gary L. Mullen Pennsylvania State University, University Park, PA
Softcover ISBN:  978-0-8218-0817-7
Product Code:  CONM/225
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7816-3
Product Code:  CONM/225.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-0817-7
eBook ISBN:  978-0-8218-7816-3
Product Code:  CONM/225.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 2251999; 243 pp
    MSC: Primary 11; Secondary 05; 94;

    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 modern mathematics. Finite fields now play particularly important roles in number theory, algebra, and algebraic geometry. They also play a crucial role in computer science, statistics, and engineering. Areas of application include but are not limited to algebraic coding theory, cryptology, and combinatorial design theory. Computational and algorithmic aspects of finite field problems are also growing in significance.

    The conference drew workers in theoretical, applied, and algorithmic finite field theory. All papers were refereed. They are loosely classified as theoretical and applied and are listed under these general headings. The work contains up-to-date results from leading experts in the field.

    Readership

    Graduate students, pure and applied mathematicians, computer scientists, and communications engineers working in error-correcting codes and public key cryptography.

  • Table of Contents
     
     
    • Articles
    • Joel V. Brawley, Shuhong Gao and Donald Mills — Computing composed products of polynomials [ MR 1650621 ]
    • Stephen D. Cohen and Dirk Hachenberger — Actions of linearized polynomials on the algebraic closure of a finite field [ MR 1650613 ]
    • Peter Fleischmann and Wolfgang Lempken — On degree bounds for invariant rings of finite groups over finite fields [ MR 1650609 ]
    • Shuhong Gao, Jason Howell and Daniel Panario — Irreducible polynomials of given forms [ MR 1650605 ]
    • Yves Hellegouarch — An application of Galois calculus to ${\bf F}_q[t]$ [ MR 1650601 ]
    • Marie Henderson and Rex Matthews — Composition behaviour of sub-linearised polynomials over a finite field [ MR 1650597 ]
    • Philippe Langevin and Patrick Solé — Kernels and defaults [ MR 1650593 ]
    • Harald Niederreiter and Chaoping Xing — Global function fields with many rational places and their applications [ MR 1650592 ]
    • Greg Stein — Traces of roots of unity over prime fields [ MR 1650596 ]
    • Henning Stichtenoth — The Fermat curve in characteristic $p$ [ MR 1650600 ]
    • Daqing Wan — Computing zeta functions over finite fields [ MR 1650604 ]
    • Thierry P. Berger — Cyclic alternant codes induced by an automorphism of a GRS code [ MR 1650608 ]
    • Claude Carlet — On Kerdock codes [ MR 1650612 ]
    • Jérôme Lacan and Emmanuelle Delpeyroux — Permutation group of the $q$-ary image of some $q^m$-ary cyclic codes [ MR 1650616 ]
    • Osnat Keren and Simon Litsyn — The number of solutions to a system of equations and spectra of codes [ MR 1650620 ]
    • Willi More — The LD probable prime test [ MR 1650624 ]
    • Siguna M. S. Müller — Carmichael numbers and Lucas tests [ MR 1650628 ]
    • Tim Blackmore and Graham Norton — On the state complexity of some long codes [ MR 1650632 ]
    • Hisao Sakazaki, Eiji Okamoto and Masahiro Mambo — ID-based key distribution system over an elliptic curve [ MR 1650636 ]
    • Ryoh Fuji-Hara and Satoshi Shinohara — Symmetric sets of curves and combinatorial arrays [ MR 1650640 ]
    • Jay A. Wood — Weight functions and the extension theorem for linear codes over finite rings [ MR 1650644 ]
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 2251999; 243 pp
MSC: Primary 11; Secondary 05; 94;

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 modern mathematics. Finite fields now play particularly important roles in number theory, algebra, and algebraic geometry. They also play a crucial role in computer science, statistics, and engineering. Areas of application include but are not limited to algebraic coding theory, cryptology, and combinatorial design theory. Computational and algorithmic aspects of finite field problems are also growing in significance.

The conference drew workers in theoretical, applied, and algorithmic finite field theory. All papers were refereed. They are loosely classified as theoretical and applied and are listed under these general headings. The work contains up-to-date results from leading experts in the field.

Readership

Graduate students, pure and applied mathematicians, computer scientists, and communications engineers working in error-correcting codes and public key cryptography.

  • Articles
  • Joel V. Brawley, Shuhong Gao and Donald Mills — Computing composed products of polynomials [ MR 1650621 ]
  • Stephen D. Cohen and Dirk Hachenberger — Actions of linearized polynomials on the algebraic closure of a finite field [ MR 1650613 ]
  • Peter Fleischmann and Wolfgang Lempken — On degree bounds for invariant rings of finite groups over finite fields [ MR 1650609 ]
  • Shuhong Gao, Jason Howell and Daniel Panario — Irreducible polynomials of given forms [ MR 1650605 ]
  • Yves Hellegouarch — An application of Galois calculus to ${\bf F}_q[t]$ [ MR 1650601 ]
  • Marie Henderson and Rex Matthews — Composition behaviour of sub-linearised polynomials over a finite field [ MR 1650597 ]
  • Philippe Langevin and Patrick Solé — Kernels and defaults [ MR 1650593 ]
  • Harald Niederreiter and Chaoping Xing — Global function fields with many rational places and their applications [ MR 1650592 ]
  • Greg Stein — Traces of roots of unity over prime fields [ MR 1650596 ]
  • Henning Stichtenoth — The Fermat curve in characteristic $p$ [ MR 1650600 ]
  • Daqing Wan — Computing zeta functions over finite fields [ MR 1650604 ]
  • Thierry P. Berger — Cyclic alternant codes induced by an automorphism of a GRS code [ MR 1650608 ]
  • Claude Carlet — On Kerdock codes [ MR 1650612 ]
  • Jérôme Lacan and Emmanuelle Delpeyroux — Permutation group of the $q$-ary image of some $q^m$-ary cyclic codes [ MR 1650616 ]
  • Osnat Keren and Simon Litsyn — The number of solutions to a system of equations and spectra of codes [ MR 1650620 ]
  • Willi More — The LD probable prime test [ MR 1650624 ]
  • Siguna M. S. Müller — Carmichael numbers and Lucas tests [ MR 1650628 ]
  • Tim Blackmore and Graham Norton — On the state complexity of some long codes [ MR 1650632 ]
  • Hisao Sakazaki, Eiji Okamoto and Masahiro Mambo — ID-based key distribution system over an elliptic curve [ MR 1650636 ]
  • Ryoh Fuji-Hara and Satoshi Shinohara — Symmetric sets of curves and combinatorial arrays [ MR 1650640 ]
  • Jay A. Wood — Weight functions and the extension theorem for linear codes over finite rings [ MR 1650644 ]
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.