Amazon cover image
Image from Amazon.com
Image from Google Jackets

Graphs, Codes and Designs / P. J. Cameron, J. H. van Lint.

By: Contributor(s): Material type: TextTextSeries: London Mathematical Society Lecture Note Series ; no. 43 | London Mathematical Society Lecture Note Series ; no. 43.Publisher: Cambridge : Cambridge University Press, 1980Description: 1 online resource (156 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780511662140 (ebook)
Other title:
  • Graphs, Codes & Designs
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 511/.5 n/a
LOC classification:
  • QA166  .C353
Online resources: Summary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK11996

Title from publisher's bibliographic system (viewed on 16 Oct 2015).

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India