Finite Fields: Theory, Applications and Algorithms

Finite Fields: Theory, Applications and Algorithms Theory, Applications, and Algorithms : Fourth International Conference on Finite Fields-- Theory, Applications, and Algorithms, August 12-15, 1997, University of Waterloo, Ontario, Canada

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.
Sign up to use