Finite Fields and Applications -

Finite Fields and Applications

7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers
Buch | Softcover
VIII, 263 Seiten
2004 | 2004
Springer Berlin (Verlag)
978-3-540-21324-6 (ISBN)
53,49 inkl. MwSt
Thisvolumerepresentstherefereedproceedingsofthe7thInternationalC- ference on Finite Fields and Applications (F 7) held during May 5 9, q 2003, in Toulouse, France. The conference was hosted by the Pierre Baudis C- gress Center, downtown, and held at the excellent conference facility. This event continued a series of biennial international conferences on Finite Fields and - plications, following earlier meetings at the University of Nevada at Las Vegas (USA) in August 1991 and August 1993, the University of Glasgow (UK) in July 1995, the University of Waterloo (Canada) in August 1997, the Univ- sity of Augsburg (Germany) in August 1999, and the Universidad Aut onoma Metropolitana-Iztapalapa, in Oaxaca (Mexico) in 2001. The Organizing Committee of F 7 consisted of Claude Carlet (INRIA, Paris, q France), Dieter Jungnickel (University of Augsburg, Germany), Gary Mullen (Pennsylvania State University, USA), Harald Niederreiter (National University of Singapore, Singapore), Alain Poli, Chair (Paul Sabatier University, Toulouse, France), Henning Stichtenoth (Essen University, Germany), and Horacio Tapia- Recillas (Universidad Aut onoma Metropolitan-Iztapalapa, Mexico). The program of the conference consisted of four full days and one half day of sessions, with eight invited plenary talks, and close to 60 contributed talks.

On the Autocorrelation of Cyclotomic Generators.- The Weierstrass Semigroup of an m-tuple of Collinear Points on a Hermitian Curve.- On Cyclic Top-Associative Generalized Galois Rings.- Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves.- Mutual Irreducibility of Certain Polynomials.- Lattice Profile and Linear Complexity Profile of Pseudorandom Number Sequences.- Symplectic Spreads and Permutation Polynomials.- What Do Random Polynomials over Finite Fields Look Like?.- Combinatorics of the Two-Variable Zeta Function.- Constructions of Mutually Unbiased Bases.- A Construction of Matrices with No Singular Square Submatrices.- Everywhere Ramified Towers of Global Function Fields.- On the Construction of Some Towers over Finite Fields.- The Covering Radius of Some Primitive Ternary BCH Codes.- The Gray Map on GR(p 2, n) and Repeated-Root Cyclic Codes.- Primitive Polynomials over Small Fields.- Vectorial Functions and Covering Sequences.- u q -Sharp Subsets of a Finite Field.- Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials.

Erscheint lt. Verlag 19.3.2004
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo VIII, 263 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 233 mm
Gewicht 420 g
Themenwelt Mathematik / Informatik Informatik
Mathematik / Informatik Mathematik Algebra
Schlagworte Algorithm analysis and problem complexity • coding theory • combinatorics • Complexity • Computational Linear Algebra • computational mathematics • Computeralgebra • Elliptic Curves • finite field • Finite Field Computations • Finite Fields • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • HC/Mathematik/Arithmetik, Algebra • Irreducibility • matrix computation • Permutation • permutations • polynomials • randomness • Scientific Computing • Variable
ISBN-10 3-540-21324-4 / 3540213244
ISBN-13 978-3-540-21324-6 / 9783540213246
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich