Finite Fields for Computer Scientists and Engineers

Front Cover
Springer Science & Business Media, Dec 6, 2012 - Technology & Engineering - 208 pages
This book developed from a course on finite fields I gave at the University of Illinois at Urbana-Champaign in the Spring semester of 1979. The course was taught at the request of an exceptional group of graduate students (includ ing Anselm Blumer, Fred Garber, Evaggelos Geraniotis, Jim Lehnert, Wayne Stark, and Mark Wallace) who had just taken a course on coding theory from me. The theory of finite fields is the mathematical foundation of algebraic coding theory, but in coding theory courses there is never much time to give more than a "Volkswagen" treatment of them. But my 1979 students wanted a "Cadillac" treatment, and this book differs very little from the course I gave in response. Since 1979 I have used a subset of my course notes (correspond ing roughly to Chapters 1-6) as the text for my "Volkswagen" treatment of finite fields whenever I teach coding theory. There is, ironically, no coding theory anywhere in the book! If this book had a longer title it would be "Finite fields, mostly of char acteristic 2, for engineering and computer science applications. " It certainly does not pretend to cover the general theory of finite fields in the profound depth that the recent book of Lidl and Neidereitter (see the Bibliography) does.
 

Contents

Prologue
1
Euclidean Domains and Euclids Algorithm
2
Unique Factorization in Euclidean Domains
3
Building Fields from Euclidean Domains
23
Abstract Properties of Finite Fields
53
Finite Fields Exist and are Unique
57
Factoring Polynomials over Finite Fields
95
Trace Norm and BitSerial Multiplication
99
Linear Recurrences over Finite Fields
149
The Theory of mSequences
167
Crosscorrelation Properties of mSequences
175
Bibliography
201
Index
203
3
204
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information