Product Description

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.

Product Details

• Amazon Sales Rank: #769130 in Books
• Published on: 1996-06-27
• Format: Abridged
• Original language: English
• Number of items: 1
• Binding: Paperback
• 341 pages

Review
"Covers the standard course in the theory of finite fields and error-correcting codes, and contains a comprehensive introduction to algebraic-geometric codes." --Mathematical Reviews

Customer Reviews

Serious entry-level coding theory
This book is a great entry-level book on coding theory. It can be used
as course text as well as self study text at advanced undergraduate
or postgraduate level. The chapters on finite fields are
amazing. Intuitive and higly non-trivial towards the end. BCH codes
and Reed-Solomon codes are also handled quite nicely.
The book has some fairly annoying typos, and quite a few inane
ones. This is the reason that I did not give five stars.