128 products were found matching your search for Lidl Rudolf Finite Fields in 1 shops:

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 each chapter is self contained and peer reviewed. The first part of the book traces the history of finite fields through the eighteenth and nineteenth centuries. The second part presents theoretical properties of finite fields, covering polynomials, special functions, sequences, algorithms, curves, and related computational aspects. The final part describes various mathematical and practical applications of finite fields in combinatorics, algebraic coding theory, cryptographic systems, biology, quantum information theory, engineering, and other areas. The book provides a comprehensive index and easy access to over 3,000 references, enabling you to quickly locate up-to-date facts and results regarding finite fields.

Finite fields are algebraic structures in which there is much research interest. This book gives a state-of-the-art account of finite fields and their applications in communications (coding theory, cryptology), combinatorics, design theory, quasirandom points, algorithms and their complexity. Typically, theory and application are tightly interwoven in the survey articles and original research papers included here. The book also demonstrates interconnections with other branches of pure mathematics such as number theory, group theory and algebraic geometry. This volume is an invaluable resource for any researcher in finite fields or related areas.

A large portion of the book can be used as a textbook for graduate and upper level undergraduate students in mathematics, communication engineering, computer science and other fields. The remaining part can be used as references for specialists. Explicit construction and computation of finite fields are emphasized. In particular, the construction of irreducible polynomials and normal basis of finite field is included. A detailed treatment of optimal normal basis and Galoi's rings is included. It is the first time that the galois rings are in book form.

The theory of finite fields, whose origins can be traced back to the works of Gauss and Galois, has played a part in various branches in mathematics. Inrecent years we have witnessed a resurgence of interest in finite fields, and this is partly due to important applications in coding theory and cryptography. The purpose of this book is to introduce the reader to some of these recent developments. It should be of interest to a wide range of students, researchers and practitioners in the disciplines of computer science, engineering and mathematics. We shall focus our attention on some specific recent developments in the theory and applications of finite fields. While the topics selected are treated in some depth, we have not attempted to be encyclopedic. Among the topics studied are different methods of representing the elements of a finite field (including normal bases and optimal normal bases), algorithms for factoring polynomials over finite fields, methods for constructing irreducible polynomials, the discrete logarithm problem and its implications to cryptography, the use of elliptic curves in constructing public key cryptosystems, and the uses of algebraic geometry in constructing good error-correcting codes. To limit the size of the volume we have been forced to omit some important applications of finite fields. Some of these missing applications are briefly mentioned in the Appendix along with some key references.

This book provides engineers and computer scientists with all the tools necessary to implement modern error-processing techniques. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The first part introduces the basic ideas of coding theory. The second and third cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature is a simplified (but rigorous) treatment of the geometry of curves.

New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Rational points on algebraic curves over finite fields is a key topic for algebraic geometers and coding theorists. Here, the authors relate an important application of such curves, namely, to the construction of low-discrepancy sequences, needed for numerical methods in diverse areas. They sum up the theoretical work on algebraic curves over finite fields with many rational points and discuss the applications of such curves to algebraic coding theory and the construction of low-discrepancy sequences.

This book provides a brief and accessible introduction to the theory of finite fields and to some of their many fascinating and practical 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. Each of the remaining chapters details applications. 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. Each chapter includes a set of exercises of varying levels of difficulty which help to further explain and motivate the material. Appendix A provides a brief review of the basic number theory and abstract algebra used in the text,

Unread book in perfect condition.

A large portion of the book can be used as a textbook for graduate and upper level undergraduate students in mathematics, communication engineering, computer science and other fields. The remaining part can be used as references for specialists. Explicit construction and computation of finite fields are emphasized. In particular, the construction of irreducible polynomials and normal basis of finite field is included. A detailed treatment of optimal normal basis and Galoi's rings is included. It is the first time that the galois rings are in book form.

Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 1.74

This book provides an accessible and self-contained introduction to the theory of algebraic curves over a finite field, a subject that has been of fundamental importance to mathematics for many years and that has essential applications in areas such as finite geometry, number theory, error-correcting codes, and cryptology. Unlike other books, this one emphasizes the algebraic geometry rather than the function field approach to algebraic curves. The authors begin by developing the general theory of curves over any field, highlighting peculiarities occurring for positive characteristic and requiring of the reader only basic knowledge of algebra and geometry. The special properties that a curve over a finite field can have are then discussed. The geometrical theory of linear series is used to find estimates for the number of rational points on a curve, following the theory of Stöhr and Voloch. The approach of Hasse and Weil via zeta functions is explained, and then attention turns to more advanced results: a state-of-the-art introduction to maximal curves over finite fields is provided; a comprehensive account is given of the automorphism group of a curve; and some applications to coding theory and finite geometry are described. The book includes many examples and exercises. It is an indispensable resource for researchers and the ideal textbook for graduate students.

This book is an account of the combinatorics of projective spaces over a finite field, with special emphasis on one and two dimensions. With its successor volumes, Finite projective spaces over three dimensions (1985), which is devoted to three dimensions, and General Galois geometries (1991), on a general dimension, it provides the only comprehensive treatise on this area of mathematics. The area is interesting in itself, but is important for its applications to coding theory and statistics, and its use of group theory, algebraic geometry, and number theory. This new edition is a complete reworking, containing extensive revisions, particularly in the chapters on generalities, the geometry of arcs in ovals, the geometry of arcs of higher degree, and blocking sets. Part I gives a survey of finite fields and an outline of the fundamental properties of projective spaces and their automorphisms; it includes the properties of algebraic varieties and curves used throughout the book and in the companion volumes. Part II covers, in an arbitrary dimension, the properties of subspaces, of partitions into both subspaces and subgeometries, and of quadrics and Hermitian varieties, as well as polarities. Part III is a detailed account of the line and plane; with little reference to the generalities from Parts I and II, the author revisits fundamental properties of the plane and then describes the structure of arcs and their relation to curves. This part includes chapters on blocking sets and on small planes (those with orders up to thirteen). With a comprehensive bibliography containing over 3,000 items, this volume will prove invaluable to researchers in finite geometry, coding theory and combinatorics.

This book provides an accessible and self-contained introduction to the theory of algebraic curves over a finite field, a subject that has been of fundamental importance to mathematics for many years and that has essential applications in areas such as finite geometry, number theory, error-correcting codes, and cryptology. Unlike other books, this one emphasizes the algebraic geometry rather than the function field approach to algebraic curves. The authors begin by developing the general theory of curves over any field, highlighting peculiarities occurring for positive characteristic and requiring of the reader only basic knowledge of algebra and geometry. The special properties that a curve over a finite field can have are then discussed. The geometrical theory of linear series is used to find estimates for the number of rational points on a curve, following the theory of Stöhr and Voloch. The approach of Hasse and Weil via zeta functions is explained, and then attention turns to more advanced results: a state-of-the-art introduction to maximal curves over finite fields is provided; a comprehensive account is given of the automorphism group of a curve; and some applications to coding theory and finite geometry are described. The book includes many examples and exercises. It is an indispensable resource for researchers and the ideal textbook for graduate students.

The theory of finite fields, whose origins can be traced back to the works of Gauss and Galois, has played a part in various branches in mathematics. Inrecent years we have witnessed a resurgence of interest in finite fields, and this is partly due to important applications in coding theory and cryptography. The purpose of this book is to introduce the reader to some of these recent developments. It should be of interest to a wide range of students, researchers and practitioners in the disciplines of computer science, engineering and mathematics. We shall focus our attention on some specific recent developments in the theory and applications of finite fields. While the topics selected are treated in some depth, we have not attempted to be encyclopedic. Among the topics studied are different methods of representing the elements of a finite field (including normal bases and optimal normal bases), algorithms for factoring polynomials over finite fields, methods for constructing irreducible polynomials, the discrete logarithm problem and its implications to cryptography, the use of elliptic curves in constructing public key cryptosystems, and the uses of algebraic geometry in constructing good error-correcting codes. To limit the size of the volume we have been forced to omit some important applications of finite fields. Some of these missing applications are briefly mentioned in the Appendix along with some key references.

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 each chapter is self contained and peer reviewed. The first part of the book traces the history of finite fields through the eighteenth and nineteenth centuries. The second part presents theoretical properties of finite fields, covering polynomials, special functions, sequences, algorithms, curves, and related computational aspects. The final part describes various mathematical and practical applications of finite fields in combinatorics, algebraic coding theory, cryptographic systems, biology, quantum information theory, engineering, and other areas. The book provides a comprehensive index and easy access to over 3,000 references, enabling you to quickly locate up-to-date facts and results regarding finite fields.

Contemporary Mathematics Vol. 16. 71 p. 26 cm. Stapled. Ex library with labels on front and inside rear cover, ink stamps on title.

This book provides engineers and computer scientists with all the tools necessary to implement modern error-processing techniques. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The first part introduces the basic ideas of coding theory. The second and third cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature is a simplified (but rigorous) treatment of the geometry of curves.

This book provides a brief and accessible introduction to the theory of finite fields and to some of their many fascinating and practical 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. Each of the remaining chapters details applications. 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. Each chapter includes a set of exercises of varying levels of difficulty which help to further explain and motivate the material. Appendix A provides a brief review of the basic number theory and abstract algebra used in the text,

Rudolf Richter is one of the leading pioneers in the field of the New Institutional Economics in Germany. The articles in this Festschrift were written by renowned scholars from Germany and other countries. In addition to general perspectives on the New Institutional Economics, the Festschrift also contains articles on the theory of the firm, economic contract theory, on pricing and competition, macroeconomics and monetary economics and on various aspects of law and economics.