Error-Correcting Codes and Finite Fields
Published on 27. June 1996
Book
Paperback/Softback
356 pages
978-0-19-269067-8 (ISBN)
Description
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.
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.
More details
Series
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Oxford University Press
Target group
College/higher education
Illustrations
line drawings
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 19 mm
Weight
547 gr
ISBN-13
978-0-19-269067-8 (9780192690678)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
Introduction; Block codes, weight, and distance; Linear codes; Error processing for linear codes; Hamming codes; Appendix: Linear algebra; Introduction and an example; Euclid's algorithm; Invertible and irreducible elements; The construction of finite fields; The structure of finite fields; Roots of polynomials; Primitive elements; Appendix: Polynomials over a field; BCH-codes as subcodes of Hamming codes; BCH codes as polynomial codes; Decoding BCH codes (1) the fundamental equation; Decoding BCH codes: (2) an error processing algorithm; Reed-Solomon codes and burst error correction; Bounds on codes; Classical Goppa codes; Classical Goppa codes: error processing; Introduction to algebraic curves; Functions on algebraic curves; A survey of the theory of algebraic curves; Geometric Goppa codes; An error processor for geometric Goppa codes.