𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Finite Fields for Computer Scientists and Engineers

✍ Scribed by Robert J. McEliece (auth.)


Publisher
Springer US
Year
1987
Tongue
English
Leaves
211
Series
The Kluwer International Series in Engineering and Computer Science 23
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.

✦ Table of Contents


Front Matter....Pages i-xi
Prologue....Pages 1-2
Euclidean Domains and Euclid’s Algorithm....Pages 3-12
Unique Factorization in Euclidean Domains....Pages 13-18
Building Fields from Euclidean Domains....Pages 19-28
Abstract Properties of Finite Fields....Pages 29-53
Finite Fields Exist and are Unique....Pages 55-73
Factoring Polynomials over Finite Fields....Pages 75-96
Trace, Norm, and Bit-Serial Multiplication....Pages 97-121
Linear Recurrences over Finite Fields....Pages 123-149
The Theory of m -Sequences....Pages 151-167
Crosscorrelation Properties of m -Sequences....Pages 169-200
Back Matter....Pages 201-207

✦ Subjects


Electrical Engineering;Algebra


πŸ“œ SIMILAR VOLUMES


Finite Fields for Computer Scientists an
✍ Robert J. McEliece πŸ“‚ Library πŸ“… 1986 🌐 English

The theory of finite fields is of central importance in engineering and computer science, because of its applications to error-correcting codes, cryptography, spread-spectrum communications, and digital signal processing. Though not inherently difficult, this subject is almost never taught in de

Scientific Computing: For Scientists and
✍ Timo Heister, Leo G. Rebholz πŸ“‚ Library πŸ“… 2023 πŸ› De Gruyter 🌐 English

Scientific Computing for Scientists and Engineers is designed to teach undergraduate students relevant numerical methods and required fundamentals in scientific computing. Most problems in science and engineering require the solution of mathematical problems, most of which can only be done on a com