This 1981 collection of 33 research papers follows from a conference on the interwoven themes of finite Desarguesian spaces and Steiner systems, amongst other topics.
This book demonstrates the connection between, and the applications of, design theory to graphs and codes. It is suitable as a textbook for advanced undergraduate students.
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.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.