Artículos relacionados a Finite Fields for Computer Scientists and Engineers:...

Finite Fields for Computer Scientists and Engineers: 23 (The Springer International Series in Engineering and Computer Science, 23) - Tapa dura

McEliece, Robert J.

 
9780898381917: Finite Fields for Computer Scientists and Engineers: 23 (The Springer International Series in Engineering and Computer Science, 23)
Tapa dura
ISBN 10: 0898381916 ISBN 13: 9780898381917
Editorial: Springer, 1986

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Reseña del editor

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 depth in mathematics courses, (and even when it is the emphasis is rarely on the practical aspect). Indeed, most students get a brief and superficial survey which is crammed into a course on error-correcting codes. It is the object of this text to remedy this situation by presenting a thorough introduction to the subject which is completely sound mathematically, yet emphasizes those aspects of the subject which have proved to be the most important for applications. This book is unique in several respects. Throughout, the emphasis is on fields of characteristic 2, the fields on which almost all applications are based. The importance of Euclid's algorithm is stressed early and often. Berlekamp's polynomial factoring algorithm is given a complete explanation. The book contains the first treatment of Berlekamp's 1982 bit-serial multiplication circuits, and concludes with a thorough discussion of the theory of m-sequences, which are widely used in communications systems of many kinds.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
1986
Idioma
Inglés
ISBN 10 
0898381916
ISBN 13 
9780898381917
Encuadernación
Tapa dura
Número de páginas
224
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Alemania

Otras ediciones populares con el mismo título

9781461291855: Finite Fields for Computer Scientists and Engineers: 23 (The Springer International Series in Engineering and Computer Science)

Edición Destacada

ISBN 10:  1461291852 ISBN 13:  9781461291855
Editorial: Springer, 2011
Tapa blanda