ShopSpell

Designs, Graphs, Codes and their Links [Hardcover]

$183.99       (Free Shipping)
50 available
  • Category: Books (Mathematics)
  • Author:  Cameron, P. J., Lint, J. H. van
  • Author:  Cameron, P. J., Lint, J. H. van
  • ISBN-10:  0521413257
  • ISBN-10:  0521413257
  • ISBN-13:  9780521413251
  • ISBN-13:  9780521413251
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  252
  • Pages:  252
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-1991
  • Pub Date:  01-May-1991
  • SKU:  0521413257-11-MPOD
  • SKU:  0521413257-11-MPOD
  • Item ID: 100755828
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 01 to Jul 03
  • Notes: Brand New Book. Order Now.
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.Aimed at advanced undergraduate students or beginning graduates, this book stresses the connection between, and the applications of, design theory to graphs and codes as well as relevant topics for discussion from the theory of graphs and codes.Aimed at advanced undergraduate students or beginning graduates, this book stresses the connection between, and the applications of, design theory to graphs and codes as well as relevant topics for discussion from the theory of graphs and codes.This book stresses the connection between, and the applications of, design theory to graphs and codes. Beginning with a brief introduction to design theory and the necessary background, the book also provides relevant topics for discussion from the theory of graphs and codes.1. Design theory; 2. Strongly regular graphs; 3. Graphs with least eigenvalue -2; 4. Regular two-graphs; 5. Quasi-symmetric designs; 6. A property of the number 6; 7. Partial geometries; 8. Graphs with no triangles; 9. Codes; 10. Cyclic codes; 11. The Golay codes; 12. Reed-Muller codes; 13. Self-dual codes and projective plane; 14. Quadratic residue codes and the Assmus-Mattson theorem; 15. Symmetry codes over F3; 16. Nearly perfect binary codes and uniformly packed codes; 17. Association schemes.
Add Review