These are notes deriving from lecture courses given by the authors in 1973 at Westfield College, London. The lectures described the connection between the theory of t-designs on the one hand, and graph theory on the other. A feature of this book is the discussion of then-recent construction of t-designs from codes. Topics from a wide range of finite combinatorics are covered and the book will interest all scholars of combinatorial theory.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: September 1975
- format: Paperback
- isbn: 9780521207423
- length: 124 pages
- dimensions: 229 x 152 x 7 mm
- weight: 0.19kg
- availability: Available
Table of Contents
1. A brief introduction to design theory
2. Strongly regular graphs
3, Quasi-symmetric designs
4. Strongly regular graphs with no triangles
5. Polarities of designs
6. Extension of graphs
8. Cyclic codes
9. Threshold decoding
10. Reed–Muller codes
11. Self-orthogonal codes and designs
12. Quadratic residue codes
13. Symmetry codes over GF(3)
14. Nearly perfect binary codes and uniformly packed codes
15. Association schemes
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
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.×