Designs, Graphs, Codes and their Links
Seiten
1991
Cambridge University Press (Verlag)
978-0-521-41325-1 (ISBN)
Cambridge University Press (Verlag)
978-0-521-41325-1 (ISBN)
Although graph theory, design theory and coding theory has their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. In book the authors have considered the many and varied connections between the theories.
Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given.
Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given.
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.
| Erscheint lt. Verlag | 19.9.1991 |
|---|---|
| Reihe/Serie | London Mathematical Society Student Texts |
| Zusatzinfo | 10 Line drawings, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 157 x 236 mm |
| Gewicht | 506 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-521-41325-7 / 0521413257 |
| ISBN-13 | 978-0-521-41325-1 / 9780521413251 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
