Introduction to the theory of finite fields and to some of their many applications. The first chapter is devoted to the theory of finite fields. After covering their construction and elementary properties, the authors discuss the trace and norm functions, bases for finite fields, and properties of polynomials over finite fields. Chapter 2 deals with combinatorial topics such as the construction of sets of orthogonal Latin squares, affine and projective planes, block designs, and Hadamard matrices. Chapters 3 and 4 provide a number of constructions and basic properties of error-correcting codes and cryptographic systems using finite fields. Appendix A provides a brief review of the basic number theory and abstract algebra used in the text. Appendix B provides hints and partial solutions for many of the exercises in each chapter.--From publisher description.
Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and
Finite fields Combinatorics Algebraic coding theory Cryptography Background in number theory and abstract algebra Hints for selected exercises References Index.
Theory, Applications, and Algorithms : Fourth International Conference on Finite Fields-- Theory, Applications, and Algorithms, August 12-15, 1997, University of Waterloo, Ontario, Canada
Theory, Applications, and Algorithms : Fourth International Conference on Finite Fields-- Theory, Applications, and Algorithms, August 12-15, 1997, University of Waterloo, Ontario, Canada
The Ontario conference drew workers from theoretical, applied, and algorithm finite field theory to share their recent findings applying finite fields to such areas as number theory, algebra, and algebraic geometry. The 21 topics include actions of linearized polynomials on the algebraic closure of a finite field, kernels and defaults, computing zeta functions over finite fields, and the state complexity of some long codes. No index. Member prices are $39 for institutions and $29 for individuals. Annotation copyrighted by Book News, Inc., Portland, OR
Over the past two decades, research in the theory of Latin Squares has been growing at a fast pace, and new significant developments have taken place. This book offers a unique approach to various areas of discrete mathematics through the use of Latin Squares.
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.
Elementary Number Theory, Gove Effinger, Gary L. Mullen This text is intended to be used as an undergraduate introduction to the theory of numbers. The authors have been immersed in this area of mathematics for many years and hope that this text will inspire students (and instructors) to study, understand, and come to love this truly beautiful subject. Each chapter, after an introduction, develops a new topic clearly broken out in sections which include theoretical material together with numerous examples, each worked out in considerable detail. At the end of each chapter, after a summary of the topic, there are a number of solved problems, also worked out in detail, followed by a set of supplementary problems. These latter problems give students a chance to test their own understanding of the material; solutions to some but not all of them complete the chapter. The first eight chapters discuss some standard material in elementary number theory. The remaining chapters discuss topics which might be considered a bit more advanced. The text closes with a chapter on Open Problems in Number Theory. Students (and of course instructors) are strongly encouraged to study this chapter carefully and fully realize that not all mathematical issues and problems have been resolved! There is still much to be learned and many questions to be answered in mathematics in general and in number theory in particular.
Abstract Algebra: A Gentle Introduction advantages a trend in mathematics textbook publishing towards smaller, less expensive and brief introductions to primary courses. The authors move away from the ‘everything for everyone’ approach so common in textbooks. Instead, they provide the reader with coverage of numerous algebraic topics to cover the most important areas of abstract algebra. Through a careful selection of topics, supported by interesting applications, the authors Intend the book to be used for a one-semester course in abstract algebra. It is suitable for an introductory course in for mathematics majors. The text is also very suitable for education majors who need to have an introduction to the topic. As textbooks go through various editions and authors employ the suggestions of numerous well-intentioned reviewers, these book become larger and larger and subsequently more expensive. This book is meant to counter that process. Here students are given a "gentle introduction," meant to provide enough for a course, yet also enough to encourage them toward future study of the topic. Features Groups before rings approach Interesting modern applications Appendix includes mathematical induction, the well-ordering principle, sets, functions, permutations, matrices, and complex nubers. Numerous exercises at the end of each section Chapter "Hint and Partial Solutions" offers built in solutions manual
An Elementary Transition to Abstract Mathematics will help students move from introductory courses to those where rigor and proof play a much greater role. The text is organized into five basic parts: the first looks back on selected topics from pre-calculus and calculus, treating them more rigorously, and it covers various proof techniques; the second part covers induction, sets, functions, cardinality, complex numbers, permutations, and matrices; the third part introduces basic number theory including applications to cryptography; the fourth part introduces key objects from abstract algebra; and the final part focuses on polynomials. Features: The material is presented in many short chapters, so that one concept at a time can be absorbed by the student. Two "looking back" chapters at the outset (pre-calculus and calculus) are designed to start the student’s transition by working with familiar concepts. Many examples of every concept are given to make the material as concrete as possible and to emphasize the importance of searching for patterns. A conversational writing style is employed throughout in an effort to encourage active learning on the part of the student.
Proceedings of SPIE present the original research papers presented at SPIE conferences and other high-quality conferences in the broad-ranging fields of optics and photonics. These books provide prompt access to the latest innovations in research and technology in their respective fields. Proceedings of SPIE are among the most cited references in patent literature.
SPIE-International Society for Optical Engineering
Published Date
ISBN 10
0819460109
ISBN 13
9780819460103
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.