Finite Fields
by International Conference on Finite Fields: Theory, Applications, and Algorithms (4th : 1997 : University of Waterloo)Format: Paperback
Pub. Date: 1998-10-01
Publisher(s): Amer Mathematical Society
Other versions by this Author
List Price: $71.68
Buy New
Usually Ships in 5-7 Business Days
$68.27
Rent Textbook
Select for Price
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
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 Fourth International Conference on "Finite Fields: Theory, Applications, and Algorithms" was held at the University of Waterloo in August 1997. The conference drew workers in theoretical, applied, and algorithmic finite field theory. This volume presents the referred proceedings. 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.
Table of Contents
| Computing composed products of polynomials | |
| Actions of linearized polynomials on the algebraic closure of a finite field | |
| On degree bounds for invariant rings of finite groups over finite fields | |
| Irreducible polynomials of given forms | |
| An application of Galois calculus to $\mathbb {F}_t[t]$ | |
| Composition behavior of sub-linearised polynomials over a finite field | |
| Kernels and defaults | |
| global function fields with many rational places and their applications | |
| Traces of roots of unity over prime fields | |
| The fermat curve in charcteristic $p$ | |
| Computing zeta functions over finite fields | |
| Cyclic alternant codes induced by an automorphism of a GRS code | |
| On Kerdock codes | |
| Permutation group of the $q$-ary image of some $q^m$-ary cyclic codes | |
| The number of solutions to a system of equations and spectra of codes | |
| The LD probable prime test | |
| Carmichael numbers and Lucas tests | |
| On the state complexity of some long codes | |
| ID-based key distribution system over an elliptic curve | |
| Symmetric sets of curves and combinatorial arrays | |
| Weight functions and the extension theorem for linear codes over finite rings | |
| Table of Contents provided by Publisher. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.