LEADER 05999nam 22008775 450 001 996465547203316 005 20200702155355.0 010 $a1-280-30720-X 010 $a9786610307203 010 $a3-540-24633-9 024 7 $a10.1007/b95905 035 $a(CKB)1000000000212325 035 $a(DE-He213)978-3-540-24633-6 035 $a(SSID)ssj0000155277 035 $a(PQKBManifestationID)11946805 035 $a(PQKBTitleCode)TC0000155277 035 $a(PQKBWorkID)10112901 035 $a(PQKB)10025513 035 $a(MiAaPQ)EBC3088626 035 $a(PPN)155221418 035 $a(EXLCZ)991000000000212325 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFinite Fields and Applications$b[electronic resource] $e7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers /$fedited by Gary L. Mullen, Alain Poli, Henning Stichtenoth 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (VIII, 263 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2948 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-21324-4 320 $aIncludes bibliographical references and index. 327 $aOn 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. 330 $aThisvolumerepresentstherefereedproceedingsofthe7thInternationalC- 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2948 606 $aAlgebra 606 $aNumerical analysis 606 $aCoding theory 606 $aInformation theory 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aField theory (Physics) 606 $aAlgebra$3https://scigraph.springernature.com/ontologies/product-market-codes/M11000 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 606 $aField Theory and Polynomials$3https://scigraph.springernature.com/ontologies/product-market-codes/M11051 615 0$aAlgebra. 615 0$aNumerical analysis. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aField theory (Physics). 615 14$aAlgebra. 615 24$aNumeric Computing. 615 24$aCoding and Information Theory. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aField Theory and Polynomials. 676 $a512.3 702 $aMullen$b Gary L$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPoli$b Alain$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aStichtenoth$b Henning$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Finite Fields and Applications 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465547203316 996 $aFinite fields and applications$91431579 997 $aUNISA