Chapter sixteen is devoted to the geometric description of codes. Projective geometry is explained, and linear codes are described as multisets of points on the projective plane. Much of the chapter is devoted to quadratic forms and caps (points on a projective plane such that no three points are collinear). Chapter seventeen covers additive codes. Applications in computer memory systems and deep-space communication are brie y discussed, and a section is devoted to quantum codes. The nal chapter focuses on boundaries, including linear programming bounds, sphere packing, and the kissing number (a variant of sphere packing). The last few sections are devoted to nonlinear codes. Opinion I enjoyed reading this book; the author is good about de ning 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. Answers to the problems, however, are not provided. While the book gets very technical, particularly in the later chapters, it should be accessible to the typical computer science graduate student; I would recommend it for a graduate class on coding theory. Students without as much experience following
/lp/association-for-computing-machinery/review-of-codes-the-guide-to-secrecy-from-ancient-to-modern-times-by-lqcyDay835