Error-Correcting Codes and Finite Fields (Student Edition)

Oliver Pretzel

ISBN 10: 0192690671 / ISBN 13: 9780192690678

Edité par Oxford University Press, 2000

A propos de cet article

Very good condition, clean and unmarked inside. One small stamp on bottom edge of pages, light handling wear.

N° de réf. du vendeur 1133366

Détails bibliographiques

• Titre: Error-Correcting Codes and Finite Fields (Student Edition)
• Éditeur: Oxford University Press
• Date de parution: 2000
• Langue: anglais
• ISBN à 10 chiffres: 0192690671
• ISBN à 13 chiffres: 9780192690678
• Reliure: Soft cover
• État de l'article: Very good
• État de la jaquette: No jacket
• Catalogues du vendeur:
  • Mathematics

A propos de ce titre

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.

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.