Finite fields : theory, applications, and algorithms : Second International Conference on Finite Fields : Theory, Applications, and Algorithms, August 17-21, 1993, Las Vegas, Nevada
著者
書誌事項
Finite fields : theory, applications, and algorithms : Second International Conference on Finite Fields : Theory, Applications, and Algorithms, August 17-21, 1993, Las Vegas, Nevada
（Contemporary mathematics, v. 168）
American Mathematical Society, c1994
大学図書館所蔵 件 / 全70件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"Contains the refereed proceedings of the conference ... held at the University of Nevada, Las Vegas, on August 17-21, 1993 ... supported in part by the National Security Agency, the National Science Foundation, and the University of Nevada, Las Vegas"--T.p. verso
Includes bibliographical references
内容説明・目次
内容説明
Because of their applications in so many diverse areas, finite fields continue to play increasingly important roles in various branches of modern mathematics, including number theory, algebra, and algebraic geometry, as well as in computer science, information theory, statistics, and engineering. Computational and algorithmic aspects of finite field problems also continue to grow in importance. This volume contains the refereed proceedings of a conference entitled Finite Fields: Theory, Applications and Algorithms, held in August 1993 at the University of Nevada at Las Vegas. Among the topics treated are theoretical aspects of finite fields, coding theory, cryptology, combinatorial design theory, and algorithms related to finite fields. Also included is a list of open problems and conjectures. This volume is an excellent reference for applied and research mathematicians as well as specialists and graduate students in information theory, computer science, and electrical engineering.
目次
Tools for coset weight enumerators of some codes by P. Charpin Algebraic decoding of cyclic codes: A polynomial ideal point of view by X. Chen, I. S. Reed, T. Helleseth, and T. K. Truong Polynomial factorisation, graphs, designs and codes by S. D. Cohen Character sums as orthogonal eigenfunctions of adjacency operators for Cayley graphs by R. Evans Combinatorial cryptosystems galore! by M. Fellows and N. Koblitz A family of cryptosystems based on combinatorial properties of finite geometries by R. Figueroa, P. M. Salzberg, and P. J.-S. Shiue Global construction of general exceptional covers by M. D. Fried Berlekamp's and Niederreiter's polynomial factorization algorithms by S. Gao and J. von zur Gathen Hasse-Teichmuller derivatives and products of linear recurring sequences by R. Gottfert and H. Niederreiter Factors of period polynomials for finite fields, II by S. Gurak A characterization of some ternary codes meeting the Griesmer bound by N. Hamada and T. Helleseth Projective geometry codes over prime fields by J. W. P. Hirschfeld and R. Shaw Codes over Eisenstein-Jacobi integers by K. Huber Points on Fermat curves over finite fields by H. Kiechle Lengths of factorizations for polynomials over a finite field by A. Knopfmacher, J. Knopfmacher, and R. Warlimont A note on Weil representation of $\mathrm {SL}_2({\mathbb F\!}_q)$ and Soto-Andrade sums by J. Kuang Some sequences with good autocorrelation properties by P. Langevin Pellian equation conjecture and absolutely nonsingular projective varieties over a finite field--Hecke operator and Pellian equation conjecture (IV) by H. Lu Strong pseudoprimes and generalized Carmichael numbers by R. Matthews Transformations of $4$-regular graphs and equations over finite fields of Chevalley-Warning type by O. Moreno and V. A. Zinoviev New examples of exceptional polynomials by P. Muller New deterministic factorization algorithms for polynomials over finite fields by H. Niederreiter Discrete logarithms and smooth polynomials by A. M. Odlyzko Parents, children, neighbors and the shadow by V.Pless The knapsack problem in cryptography by M. Qu and S. A. Vanstone Iterated constructions of normal bases over finite fields by A. Scheerhorn Periodicity properties of $k$ th order linear recurrences whose characteritic polynomial splits completely over a finite field, I by L. Somer Generalized Welch-Costas sequences and their application to Vatican arrays by H. Y. Song and S. W. Golomb Nonisomorphic complete sets of $F$-rectangles with varying numbers of symbols by S. J. Suchower A method of designing cellular automata as pseudorandom number generators for built-in self-test for VLSI by S. Tezuka and M. Fushimi Finite ring sums from $p$-adic K -Bessel functions by C. E. Trimble On the Gross-Koblitz formula by P. T. Young New results on diagonal equations over finite fields from cyclic codes by J. Wolfmann Open problems and conjectures by K. Huber, I.H. Morgan, G. L. Mullen, H. Niederreiter, A. Odlyzko, J. van Tilburg, and D. Wan.
「Nielsen BookData」 より
