Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) - Couverture souple

Pretzel, Oliver

 
9780192690678: Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series)
Couverture souple
ISBN 10 : 0192690671 ISBN 13 : 9780192690678
Editeur : Oxford University Press, 2002

Synopsis

This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory.

The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This textbook is a reprint of Chapters 1-20 of the original hardback edition. It provides the reader with the tools necessary to implement modern error-processing schemes. The material on algebraic geometry and geometric Goppa codes, which is not part of a standard introductory course on coding theory, has been omitted. The book assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The book is in four parts. The first introduces the basic ideas of coding theory. The second and third cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their uses of Eulid's algorithm as a central technique. The fourth part treats classical Goppa codes.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Oxford University Press
Date d'édition
2002
Langue
anglais
ISBN 10 
0192690671
ISBN 13 
9780192690678
Reliure
Broché
Nombre de pages
360
Coordonnées du fabricant
non disponible
Personne responsable
Ufficio Anagrafiche Messaggerie
ufficio.anagrafiche@meli.it

Via Verdi, 8
Assago Milano
20090
Italie