Finite fields : theory, applications, and algorithms
Material type: Computer fileSeries: Contemporary mathematics ; v. 168Publication details: Providence, R.I. : American Mathematical Society, 1994Description: 1 online resource (xxx, 402 p. : ill.)ISBN: 9780821877593 (online)Subject(s): Finite fields (Algebra)Online resources: Click here to access onlineItem type | Current library | Call number | URL | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
electronic book | ICTS | Link to resource | Accessible Online | EBK21172 |
Includes bibliographical references.
Tools for coset weight enumerators of some codes ; Algebraic decoding of cyclic codes: a polynomial ideal point of view ; Polynomial factorisation, graphs, designs and codes ; Character sums as orthogonal eigenfunctions of adjacency operators for Cayley graphs ; Combinatorial cryptosystems galore! ; A family of cryptosystems based on combinatorial properties of finite geometries ; Global construction of general exceptional covers with motivation for applications to encoding ; Berlekamp's and Niederreiter's polynomial factorization algorithms ; HasseTeichmuller derivatives and products of linear recurring sequences ; Factors of period polynomials for finite fields. II ; A characterization of some ternary codes meeting the Griesmer bound ; Projective geometry codes over prime fields ; Codes over EisensteinJacobi integers ; Points on Fermat curves over finite fields ; Lengths of factorizations for polynomials over a finite field ; A note on Weil representation of rm SL_2(\bf F_q) and SotoAndrade sums ; Some sequences with good autocorrelation properties ; Pellian equation conjecture and absolutely nonsingular projective varieties over a finite field Hecke operator and Pellian equation conjecture. IV ; Strong pseudoprimes and generalized Carmichael numbers ; Transformations of egular graphs and equations over finite fields of ChevalleyWarning type ; New examples of exceptional polynomials ; New deterministic factorization algorithms for polynomials over finite fields ; Discrete logarithms and smooth polynomials ; Parents, children, neighbors and the shadow ; The knapsack problem in cryptography ; Iterated constructions of normal bases over finite fields ; Periodicity properties of h order linear recurrences whose characteristic polynomial splits completely over a finite field. I ; Generalized WelchCostas sequences and their application to Vatican arrays ; Nonisomorphic complete sets of ectangles with varying numbers of symbols ; A method of designing cellular automata as pseudorandom number generators for builtin selftest for VLSI ; Finite ring sums from dic essel functions ; On the GrossKoblitz formula ; New results on diagonal equations over finite fields from cyclic codes ; Open Problems and Conjectures Pascale Charpin ; Xuemin Chen I S Reed T Helleseth and T K Truong ; Stephen D Cohen ; Ronald Evans ; Michael Fellows and Neal Koblitz ; Raul Figueroa Pablo M Salzberg and Peter JauShyong Shiue ; Michael D Fried ; Shuhong Gao and Joachim von zur Gathen ; Rainer Gottfert and Harald Niederreiter ; S Gurak ; Noboru Hamada and Tor Helleseth ; J W P Hirschfeld and R Shaw ; Klaus Huber ; Hubert Kiechle ; A Knopfmacher J Knopfmacher and R Warlimont ; Jing Hua Kuang ; Philippe Langevin ; Hong Wen Lu ; Rex Matthews ; Oscar Moreno and Victor A Zinoviev ; Peter Muller ; Harald Niederreiter ; A M Odlyzko ; Vera Pless ; Ming Hua Qu and S A Vanstone ; Alfred Scheerhorn ; Lawrence Somer ; Hong Y Song and Solomon W Golomb ; Stephan J Suchower ; Shu Tezuka and Masanori Fushimi ; Cynthia E Trimble ; Paul Thomas Young ; Jacques Wolfmann ; Gary L Mullen and Peter JauShyong Shiue
There are no comments on this title.