The spirit and aim of this book is to present a compact introduction to the basic combinatorial tools - such as recurrence relations, generating functions, incidence matrices, and the inclusion-exclusion principle - that will give the reader a flavour of the distinctive characteristics of this attractive and increasingly important branch of mathematics. A studly of block designs is followed by a brief mention of applications to coding theory.
In this new edition, Steiner triple systems are constructed and S(5,8,24) is obtained via the Golay code of length 24. The final chapter combines together the three combinatorial structures of the Leech lattice, the Golay codes, and Steiner systems. Also in this edition, an application of the
marriage theorem to score sequences of tournaments has been included.
' ...excellent introductory text...' Times Higher Education Supplement
'..happy introduction for many people...' Computer Journal
Introduction to basic ideas; Selections and binomial coefficients; Pairing problems; Recurrence; The inclusion-exclusion principle; Block designs and error-correcting codes; Steiner systems, sphere packings, and the Golay code; Solutions to exercises; Bibliography; Index
Series: Oxford Applied Mathematics and Computing Science Series
Tertiary; University or College
Number Of Pages: 144
Published: 4th May 1989
Publisher: Oxford University Press
Country of Publication: GB
Dimensions (cm): 21.64 x 13.95
Weight (kg): 0.23
Edition Number: 2
Edition Type: Revised