Cover; Title; Copyright; Contents; Preface; Notation and terminology; 1. Design theory; Appendix: The Principle of Inclusion and Exclusion; Exercises; 2. Strongly regular graphs; Exercises; 3. Graphs with least eigenvalue -2; Exercises; 4. Regular two-graphs; Exercises; 5. Quasi-symmetric designs; Exercises; 6. A property of the number six; Exercises; 7. Partial geometries; Exercises; 8. Graphs with no triangles; Exercises; 9. Codes; Exercises; 10. Cyclic codes; Exercises; 11. The Golay codes; Exercises; 12. Reed-Muller and Kerdock codes; Constructions of Kerdock sets.; Exercises
13. Self-orthogonal codes and projective planesExercises; 14. Quadratic residue codes and the Assmus-Mattson Theorem; Exercises; 15. Symmetry codes over F3; Exercises; 16. Nearly perfect binary codes and uniformly packed codes; The Preparata codes.; Exercises.; 17. Association schemes; Exercises; References; Index; List of Authors
Summary
This book demonstrates the connection between, and the applications of, design theory to graphs and codes. It is suitable as a textbook for advanced undergraduate students
