UID:
almafu_9959239117702883
Format:
1 online resource (vii, 147 pages) :
,
digital, PDF file(s).
ISBN:
1-139-88383-6
,
1-107-36586-4
,
1-107-37059-0
,
1-107-36095-1
,
1-107-36945-2
,
1-299-40367-0
,
1-107-36340-3
,
0-511-66214-9
Series Statement:
London Mathematical Society lecture note series, no. 43
Content:
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.
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
,
Cover; Title; Copyright; Contents; Preface; 1. A brief introduction todesign theory; 2. Strongly regular graphs; 3. Quasi-symmetric designs; 4. Partial geometries; 5. Strongly regular graphs withno triangles; 6. Polarities of designs; 7. Extension of graphs; 8. 1-factorisations of K6; 9. Codes; 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; References; Index
,
English
Additional Edition:
ISBN 0-521-23141-8
Language:
English
Subjects:
Mathematics
URL:
https://doi.org/10.1017/CBO9780511662140
Bookmarklink
