Finite Fields and Applications 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers /

Finite Fields and Applications 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers / [electronic resource] : edited by Gary L. Mullen, Alain Poli, Henning Stichtenoth. - 1st ed. 2004. - VIII, 263 p. online resource. - Lecture Notes in Computer Science, 2948 1611-3349 ; . - Lecture Notes in Computer Science, 2948 .

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.

9783540246336

10.1007/b95905 doi


Algebra.
Numerical analysis.
Coding theory.
Information theory.
Algorithms.
Computer science--Mathematics.
Algebraic fields.
Polynomials.
Algebra.
Numerical Analysis.
Coding and Information Theory.
Algorithms.
Symbolic and Algebraic Manipulation.
Field Theory and Polynomials.

QA150-272

512
© 2024 IIIT-Delhi, library@iiitd.ac.in