Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Graph Theory, Coding Theory and Block Designs

Graph Theory, Coding Theory and Block Designs

Graph Theory, Coding Theory and Block Designs

P. J. Cameron
J. H. van Lint
September 1975
Paperback
9780521207423

Looking for an inspection copy?

This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact [email protected] providing details of the course you are teaching.

$50.00
USD
Paperback
USD
eBook

    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.

    Product details

    May 2013
    Adobe eBook Reader
    9781107107489
    0 pages
    0kg
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    Table of Contents

    • Introduction
    • 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
    • 7. Codes
    • 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
    • References
    • Index.
      Authors
    • P. J. Cameron
    • J. H. van Lint