Algebraic coding theory has in recent years been increasingly applied to the study of
combinatorial designs. This book gives an account of many of those applications together …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

Combinatorial configurations, designs, codes, graphs | Guide books skip to main content
ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …

Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

1.1 A balanced incomplete block design (BIBD) is a pair (V, B) where V is a v-set and B is a
collection of bk-subsets of V (blocks) such that each element of V is contained in exactly r …

Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

The aim of this work is to suggest a setting for the discussion and classification of finite
projective planes. In the past, two classification schemes have been put forward: the Lenz …

This is the first exposition of the theory of quasi-symmetric designs, that is, combinatorial
designs with at most two block intersection numbers. The authors aim to bring out the …

The reader familiar with\Designs and their Codes" will soon understand the debt this chapter
owes to that book| especially its Chapter 5. We have, however, entirely reworked that …

Since the publication in 1992 of “Designs and their Codes” significant progress has been
made in the general area of codes coming from designs. This article reviews this progress …