Skip to content
Register Sign in Wishlist

Graphs, Codes and Designs


Part of London Mathematical Society Lecture Note Series

  • Date Published: July 1980
  • availability: Available
  • format: Paperback
  • isbn: 9780521231411

£ 41.99

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: July 1980
    • format: Paperback
    • isbn: 9780521231411
    • length: 156 pages
    • dimensions: 228 x 152 x 9 mm
    • weight: 0.23kg
    • 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
    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.

  • Authors

    P. J. Cameron

    J. H. van Lint

Related Books

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

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

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.

Please fill in the required fields in your feedback submission.