Designs, Graphs, Codes and their Links
Part of London Mathematical Society Student Texts
- Authors:
- P. J. Cameron, Queen Mary University of London
- J. H. van Lint, Technische Universiteit Eindhoven, The Netherlands
- Date Published: September 1991
- availability: Available
- format: Hardback
- isbn: 9780521413251
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- A really significant revision of a LMS Lecture Notes classic
- Its previous two 'editions' have sold 3500+ copies Graphs Codes & Design's (1980) 1600 sales Graph Theory, Coding Theory & Block Designs (1975) 1900 sales
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: September 1991
- format: Hardback
- isbn: 9780521413251
- length: 252 pages
- dimensions: 236 x 157 x 18 mm
- weight: 0.506kg
- contains: 10 b/w illus.
- availability: Available
Table of Contents
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.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×