D. R. Hankerson is Professor of Mathematics at Auburn University, Alabama. He received the Ph.D. degree (1986)
in mathematics from the University of Nebraska at Lincoln.
Hoffman, D. G. : Auburn University, Alabama
D. G. Hoffman is Professor of Mathematics at Auburn University, Alabama. The author or coauthor of over 20 journal
articles, he received the Ph.D. degree (1976) in mathematics from the University of Waterloo, Ontario, Canada.
Leonard, D. A. : Auburn University, Alabama
D. A. Leonard is Professor of Mathematics at Auburn University, Alabama. A member of the American Mathematical
Society and Institute of Combinatorics and Its Applications, he received the Ph.D. degree (1980) in mathematics
from Ohio State University, Columbus.
Lindner, C. C. : Auburn University, Alabama
C. C. Lindner is Professor of Mathematics at Auburn University, Alabama. A member of the American Mathematical
Society, the Mathematical Association of America, the Combinatorial Mathematics Society of Australasia, and the
Canadian Mathematical Society, he received the Ph.D. degree (1969) in mathematics from Emory University, Atlanta,
Georgia.
Phelps, K. T. : Auburn University, Alabama
K. T. Phelps is Professor of Mathematics at Auburn University, Alabama. A member of the Society for Industrial
and Applied Mathematics, he received the Ph.D. degree (1976) in mathematics from Auburn University, Alabama.
Rodger, C. A. : Auburn University, Alabama
C. A. Rodger is Professor of Mathematics at Auburn University, Alabama. The author or coauthor of over 110 journal
articles and book chapters, he is a Fellow of the Australian Mathematics Society, a Foundation Fellow of the Institute
of Combinatorics and Its Applications, and a member of the Combinatorial Mathematics Society of Australasia. Professor
Rodger received the Ph.D. degree (1982) in mathematics from the University of Reading, Berkshire, England.
Wall, J. R. : Auburn University, Alabama
J. R. Wall is Professor of Mathematics at Auburn University, Alabama. A member of the Mathematical Association
of America, he received the Ph.D. degree (1971) in mathematics from the University of Tennessee, Knoxville.
Review
"The panel of authors has attempted to write a text from which students can actually be taught, and the
effort is largely successful."
--Mathematical Reviews
"�There is a welcome emphasis on construction, with many worked examples and excercises."
--Mathematika
"�provides an excellent introduction to the subject at a level that allows all of the important concepts to
be developed."
--Zentralblatt für Mathematik und ihre Grenzgebiete
"�highly recommend[ed]�for students in computer science and engineering."
--Acta Science and Mathematics
"�a very good and useful textbook."
--Romanian Journal of Pure and Applied Mathematics
Marcel Dekker, Inc. Web Site, December, 2001
Summary
This highly successful textbook, proven by the authors in a popular two-quarter course, presents coding theory,
construction, encoding, and decoding of specific code families in an "easy-to-use" manner appropriate
for students with only a basic background in mathematics�offering revised and updated material on the Berlekamp-Massey
decoding algorithm and convolutional codes. The revised edition includes an extensive new section on cryptography,
designed for an introductory course on the subject.
Containing data on number theory, encryption schemes, and cyclic codes, the Second Edition of Coding Theory
and Cryptography: The Essentials
introduces the mathematics as it is needed
contains many exercises, with solutions
provides a concise and self-contained introduction to modern cryptography, with an emphasis on public-key methods
spends considerable time on two of the most applicable codes, Reed-Solomon and convolutional codes, that are
used by NASA
describes how music is encoded on compact discs, and how error correlation enables long bursts of errors to
be corrected
and more!
Written for students with a minimal prerequisite knowledge of linear algebra, Coding Theory and Cryptography: The
Essentials, Second Edition is a remarkable text for upper-level undergraduate and graduate students taking a two-quarter,
one-semester, or two-semester coding theory course or a one- semester course in cryptography in the departments
of electrical engineering, computer science, and mathematics.
Here are just a few of the colleges and universities that have benefited from the first edition of Coding Theory:
Auburn University / California State University / University of Central Florida / East Tennessee State University
/ Hiram College / Huntington College / University of Kansas/ University of Memphis / Michigan State University
/ Morgan State University / University of Nebraska at Lincoln / New Mexico State University / University of North
Dakota / Rose-Hulman Institute of Technology / San Diego State University / Vanderbilt University / University
of Virginia / Wallace College / Wright State University
Table of Contents
Coding Theory
Introduction to Coding Theory
Linear Codes
Perfect and Related Codes
Cyclic Linear Codes
BCH Codes
Reed-Solomon Codes
Burst Error-Correcting Codes
Convolutional Codes
Reed-Muller and Preparata Codes
Cryptography
Classical Cryptography
Public-Key Cryptography
A: The Euclidean Algorithm
B: Factorization of 1 + xn
C: Example of Compact Disc Encoding
D: Solutions to Selected Exercises
Bibliography
