Finite Fields for Computer Scientists and Engineers

Author:   Robert J. McEliece
Publisher:   Kluwer Academic Publishers
Edition:   1987 ed.
Volume:   23
ISBN:  

9780898381917


Pages:   208
Publication Date:   30 November 1986
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $604.56 Quantity:  
Add to Cart

Share |

Finite Fields for Computer Scientists and Engineers


Overview

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.

Full Product Details

Author:   Robert J. McEliece
Publisher:   Kluwer Academic Publishers
Imprint:   Kluwer Academic Publishers
Edition:   1987 ed.
Volume:   23
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.50cm
Weight:   1.090kg
ISBN:  

9780898381917


ISBN 10:   0898381916
Pages:   208
Publication Date:   30 November 1986
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List