Cargando…

Finite Fields.

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. Co...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Mullen, Gary L.
Otros Autores: Shiue, Peter Jau-Shyong
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Providence : American Mathematical Society, 1994.
Colección:Contemporary Mathematics Ser.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Mu 4500
001 EBOOKCENTRAL_on1037812165
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |n|---|||||
008 180526s1994 riu o 000 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d OCLCQ  |d LOA  |d OCLCO  |d OCLCF  |d K6U  |d OCLCO  |d OCLCQ  |d OCLCO 
020 |a 9780821877593 
020 |a 0821877593 
035 |a (OCoLC)1037812165 
050 4 |a QA247.3.I58 1993 
082 0 4 |a 512/.3 
049 |a UAMI 
100 1 |a Mullen, Gary L. 
245 1 0 |a Finite Fields. 
260 |a Providence :  |b American Mathematical Society,  |c 1994. 
300 |a 1 online resource (434 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Contemporary Mathematics Ser. ;  |v v. 168 
588 0 |a Print version record. 
505 0 |a Intro; Contents; Preface; Contributors; Conference Participants; 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; Berlekamp's and Niederreiter's polynomial factorization algorithms. 
505 8 |a Hasse-Teichmiiller derivatives and products of linear recurring sequencesFactors 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 Eisenstein-Jacobi integers; Points on Fermat curves over finite fields; Lengths of factorizations for polynomials over a finite field; A note on Weil representation of SL2(Fq) and Soto-Andrade sums; Some sequences with good autocorrelation properties. 
505 8 |a Pellian equation conjecture and absolutely nonsingular projective varieties over a finite fieldâ#x80;#x93;Hecke operator and Pellian equation conjecture (IV)Strong pseudoprimes and generalized Carmichael numbers; Transformations of 4-regular graphs and equations over finite fields of Chevalley-Warning 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. 
505 8 |a Iterated constructions of normal bases over finite fieldsPeriodicity properties of kth order linear recurrences whose characteristic polynomial splits completely over a finite field, I; Generalized Welch-Costas sequences and their application to Vatican arrays; Nonisomorphic complete sets of F-rectangles with varying numbers of symbols; A method of designing cellular automata as pseudorandom number generators for built-in self-test for VLSI; Finite ring sums from p-adic K-Bessel functions; On the Gross-Koblitz formula; New results on diagonal equations over finite fields from cyclic codes. 
500 |a Open problems and conjectures. 
520 |a 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. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Finite fields (Algebra)  |v Congresses. 
650 6 |a Corps finis  |v Congrès. 
650 7 |a Finite fields (Algebra)  |2 fast 
655 7 |a Conference papers and proceedings  |2 fast 
700 1 |a Shiue, Peter Jau-Shyong. 
776 0 8 |i Print version:  |a Mullen, Gary L.  |t Finite Fields: Theory, Applications, and Algorithms.  |d Providence : American Mathematical Society, ©1994  |z 9780821851838 
830 0 |a Contemporary Mathematics Ser. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=5295205  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL5295205 
994 |a 92  |b IZTAP