2 options
Finite fields : theory, applications, and algorithms : Fourth International Conference on Finite Fields-- Theory, Applications, and Algorithms, August 12-15, 1997, University of Waterloo, Ontario, Canada / Ronald C. Mullin, Gary L. Mullen, editors.
- Format:
- Book
- Conference/Event
- Author/Creator:
- International Conference on Finite Fields: Theory, Applications, and Algorithms, Corporate Author.
- Conference Name:
- International Conference on Finite Fields: Theory, Applications, and Algorithms (4th : 1997 : University of Waterloo), issuing body.
- International Conference on Finite Fields: Theory, Applications, and Algorithms.
- Series:
- Contemporary mathematics, 0271-4132 225.
- Contemporary mathematics, 225 0271-4132
- Language:
- English
- Subjects (All):
- Finite fields (Algebra)--Congresses.
- Finite fields (Algebra).
- Physical Description:
- 1 online resource (258 p.)
- Edition:
- 1st ed.
- Place of Publication:
- Providence, Rhode Island : American Mathematical Society, [1999]
- Language Note:
- English
- Summary:
- The Ontario conference drew workers from theoretical, applied, and algorithm finite field theory to share their recent findings applying finite fields to such areas as number theory, algebra, and algebraic geometry. The 21 topics include actions of linearized polynomials on the algebraic closure of a finite field, kernels and defaults, computing zeta functions over finite fields, and the state complexity of some long codes. No index. Member prices are $39 for institutions and $29 for individuals. Annotation copyrighted by Book News, Inc., Portland, OR
- Contents:
- Contents
- Preface
- 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 Fq[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 characteristic 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 qm-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.
- Notes:
- Description based upon print version of record.
- Includes bibliographical references.
- Description based on print version record.
- ISBN:
- 0-8218-7816-6
- 0-8218-5561-1
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.