Although its roots lie in information theory, the applications of coding theory now extend to statistics, cryptography, and many areas of pure mathematics, as well as pervading large parts of theoretical computer science, from universal hashing to numerical integration.
Introduction to Coding Theory introduces the theory of error-correcting codes in a thorough but gentle presentation. Part I begins with basic concepts, then builds from binary linear codes and Reed-Solomon codes to universal hashing, asymptotic results, and 3-dimensional codes. Part II emphasizes cyclic codes, applications, and the geometric desciption of codes. The author takes a unique, more natural approach to cyclic codes that is not couched in ring theory but by virtue of its simplicity, leads to far-reaching generalizations. Throughout the book, his discussions are packed with applications that include, but reach well beyond, data transmission, with each one introduced as soon as the codes are developed.
Although designed as an undergraduate text with myriad exercises, lists of key topics, and chapter summaries, Introduction to Coding Theory explores enough advanced topics to hold equal value as a graduate text and professional reference. Mastering the contents of this book brings a complete understanding of the theory of cyclic codes, including their various applications and the Euclidean algorithm decoding of BCH-codes, and carries readers to the level of the most recent research.
Table of Contents
Part I: AN ELEMENTARY INTRODUCTION TO CODING
THE CONCEPT OF CODING
Bitstrings and Binary Operations
The Hamming Distance
Error-Correcting Codes in General
The Binary Symmetric Channel
The Sphere-Packing Bound
BINARY LINEAR CODES
The Concept of Binary Linear Codes
The Effect of Coding
Binary Hamming and Simplex Codes
Principle of Duality
GENERAL LINEAR CODES
Linear Codes Over Finite Fields
Duality and Orthogonal Arrays
The Game of Set
RECURSIVE CONSTRUCTION I
DESIGNS AND THE BINARY GOLAY CODE
3-DIMENSIONAL CODES, PROJECTIVE PLANES
SUMMARY AND OUTLOOK
Part II: THE THEORY OF CODES AND THEIR APPLICATIONS
SUBFIELD CODES AND TRACE CODES
Trace Codes and Subfield Codes
Galois Closed Codes
Some Primitive Cyclic Codes of Length 15
Theory of Cyclic Codes
RECURSIVE CONSTRUCTIONS, COVERING RADIUS
OA IN STATISTICS AND COMPUTER SCIENCE
OA and Independent Random Variables
Linear Shift Register Sequences
Two-Point Based Sampling
Derandomization of Algorithms
Authentication and Universal Hashing
THE GEOMETRIC DESCRIPTION OF CODES
Linear Codes as Sets of Points
Quadratic Forms, Bilinear Forms and Caps
Caps: Constructions and Bounds
Basic Constructions and Applications
Additive Cyclic Codes
THE LAST CHAPTER
The Linear-Programming Bound
"Although designed as an undergraduate text with myriad exercises, lists of key topics, and chapter summaries, this excellent book explores enough advanced topics to hold equal value as a graduate text and professional reference. Mastering the contents of this book brings a complete understanding of the theory of cyclic codes, including their various applications and the Euclidean algorithm decoding of BCH-codes, and carries readers to the level of the most recent research."
"Bierbrauer makes two contributions to … [the] literature with this book: he presents a method for teaching the basics of theory to undergraduates that includes a discussion of Reed-Solomon codes, and he manages to weave presentations of both the theory and applications of designs … . The writing is … readable and in fact enjoyable. … Those who seek an appropriate undergraduate text in the subject, as well as those who desire a book that incorporates a healthy does of design theory in addition to the basics of coding, may well find this a rewarding text to use in their classrooms."
- Mathematical Reviews, 2005f
"This nice textbook offers a self-contained introduction to mathematical coding theory and its major areas of application."
"I enjoyed reading this book; the author is good about defining terms as he uses them so that the logic can be followed by someone without a background in the area. The sections are short, with relevant problems at the end of each section. …It should be accessible to the typical computer science gradate student; I would recommend it for a graduate class on coding theory."