
Designs, Graphs, Codes and their Links
Cambridge University Press
Published on 19. September 1991
Book
Hardback
252 pages
978-0-521-41325-1 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Illustrations
10 Line drawings, unspecified
Dimensions
Height: 235 mm
Width: 157 mm
Thickness: 19 mm
Weight
565 gr
ISBN-13
978-0-521-41325-1 (9780521413251)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

P. J. Cameron | J. H. van Lint
Designs, Graphs, Codes and their Links
E-Book
03/2011
1st Edition
Cambridge University Press
€49.99
Available for download
Persons
Author
Queen Mary University of London
Technische Universiteit Eindhoven, The Netherlands
Content
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.