This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: July 1980
- format: Paperback
- isbn: 9780521231411
- length: 156 pages
- dimensions: 229 x 152 x 9 mm
- weight: 0.24kg
- availability: Available
Table of Contents
1. A brief introduction to design theory
2. Strongly regular graphs
3. Quasi-symmetric designs
4. Partial geometries
5. Strongly regular graphs with no triangles
6. Polarities of designs
7. Extensions of graphs
8. 1-factorisations of K6
10. Cyclic codes
11. Threshold decoding
12. Finite geometries and codes
13. Self-orthogonal codes, designs and projective planes
14. Quadratic residue codes
15. Symmetry codes over GF(3)
16. Nearly perfect binary codes and uniformly packed codes
17. 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.×