Combinatorial Designs and their Applications
CRC Press, Jan 29, 1999 - Mathematics - 160 pages
The fruit of a conference that gathered seven very active researchers in the field, Combinatorial Design and their Applications presents a wide but representative range of topics on the non-geometrical aspects of design theory. By concentrating on a few important areas, the authors succeed in providing greater detail in these areas in a more complete and accessible form. Through their contributions to this collection, they help fill a gap in the available combinatorics literature.
The papers included in this volume cover recent developments in areas of current interest, such as difference sets, cryptography, and optimal linear codes.
Researchers in combinatorics and other areas of pure mathematics, along with researchers in statistics and computer design will find in-depth, up-to-date discussions of design theory and the application of the theory to statistical design, codes, and cryptography.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Resolved designs viewed as sets of partitions
Combinatorics and threshold cryptography
Blocktransitive pointintransitive block designs
Some recent developments in difference sets
Configurations in Steiner triple systems
A survey of recent results on optimal linear codes
abelian automorphism group balanced with respect Belov type block design carry-over effects character sum Chen difference sets chromatic index classes codewords coloured graph columns combinatorial Combinatorial Designs contains a subgroup Corollary covering EBS Cryptography d]q code defined Definition digital signature directed terrace divisible difference sets double Youden rectangle efficiency factors elements Eupen Example Figure finite field finite geometries G relative given Griesmer bound group G Hadamard difference set hyperplanes integer isomorphic Latin squares Lemma linear codes Math matrix meeting the Griesmer minihyper multiset n-line configuration nested row-column design non-principal character non-zero number of blocks pair pairwise parameters partitions Pasch configuration perfect hash family PG(k problem Proof quadric resolved design resolved incomplete-block design Rosa round rows Rp(A schedule secret sharing scheme Section semi-regular starter Steiner triple systems strictly orthogonal STS(v subset superblocks teams Theorem 3.1 threshold signature scheme treatments two-weight codes vector