UID:
almafu_9959234636602883
Umfang:
1 online resource (viii, 240 pages) :
,
digital, PDF file(s).
ISBN:
1-316-08698-4
,
1-107-36887-1
,
1-107-36665-8
,
1-107-36174-5
,
0-511-62371-2
,
1-299-40903-2
,
1-107-36419-1
Serie:
London Mathematical Society student texts ; 22
Inhalt:
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.
Anmerkung:
Reprint. First published 1991.
,
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
,
English
Weitere Ausg.:
ISBN 0-521-41325-7
Weitere Ausg.:
ISBN 0-521-42385-6
Sprache:
Englisch
