
Finite Fields for Computer Scientists and Engineers
Robert J. McEliece(Author)
Kluwer Academic Publishers
Published on 30. November 1986
Book
Hardback
XII, 208 pages
978-0-89838-191-7 (ISBN)
Description
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.
More details
Series
Edition
1987 ed.
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Research
Illustrations
XII, 208 p.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 17 mm
Weight
503 gr
ISBN-13
978-0-89838-191-7 (9780898381917)
DOI
10.1007/978-1-4613-1983-2
Schweitzer Classification
Other editions
Additional editions

Robert J. McEliece
Finite Fields for Computer Scientists and Engineers
E-Book
12/2012
Springer
€213.99
Available for download

Robert J. McEliece
Finite Fields for Computer Scientists and Engineers
Book
09/2011
Springer
€235.39
Shipment within 15-20 days
Content
1 Prologue.- 2 Euclidean Domains and Euclid's Algorithm.- 3 Unique Factorization in Euclidean Domains.- 4 Building Fields from Euclidean Domains.- 5 Abstract Properties of Finite Fields.- 6 Finite Fields Exist and are Unique.- 7 Factoring Polynomials over Finite Fields.- 8 Trace, Norm, and Bit-Serial Multiplication.- 9 Linear Recurrences over Finite Fields.- 10 The Theory of m-Sequences.- 11 Crosscorrelation Properties of m-Sequences.