Topics in Galois Fields: 29 (Algorithms and Computation in Mathematics, 29) - Hardcover

Hachenberger, Dirk; Jungnickel, Dieter

Hardcover

ISBN 10: 3030608042 ISBN 13: 9783030608040

Publisher: Springer, 2020

Synopsis

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields.

We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm.

The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

About this title

About the Author

Dirk Hachenberger is a mathematician working in the fields of combinatorics, number theory, applicable algebra, finite geometry and coding theory. He is the recipient of the 2004 Hall medal of the Institute for Combinatorics and its Applications (ICA). He was also awarded the price for good teaching of the Bavarian State Minister for Science, Research and Arts in 2004. He has published the books "Finite Fields: Normal bases and completely free elements" (in English) and "Mathematics for computer scientists" (in German).

Dieter Jungnickel is an internationally known mathematician working in the fields of applicable algebra, coding theory, design theory, finite geometry, combinatorics and combinatorial optimization. He is the recipient of the 2018 Euler medal of the Institute for Combinatorics and its Applications (ICA). He has published several well-known books, including “Design Theory”, “Optimization Methods”, “Finite fields: Structure and arithmetics”, “CodingTheory”, “Combinatorics” and “Graphs, Networks and Algorithms”, some of which have been published both in English and German.

From the Back Cover

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields.

We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm.

The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working ininformation and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

Edition details

• Publisher: Springer
• Publication date: 2020
• Language: English
• ISBN 10: 3030608042
• ISBN 13: 9783030608040
• Binding: Hardcover
• Edition number: 1
• Number of pages: 799