CRC Handbook of Combinatorial Designs: (Discrete Mathematics and Its Applications)

From experimental design to cryptography, this comprehensive, easy-to-access reference contains literally all the facts you need on combinatorial designs. It includes constructions of designs, existence results, and properties of designs. Organized into six main parts, the CRC Handbook of Combinatorial Designs covers:

Table of Contents:
Balanced Incomplete Block Designs and t-Designs 2-(v,k,l) Designs of Small Order BIBDs with Small Block Size t-Designs, t = 3 Steiner Systems Symmetric Designs Resolvable and Near Resolvable Designs Latin Squares, MOLS, and Orthogonal Arrays Latin Squares Mutually Orthogonal Latin Squares (MOLS) Incomplete MOLS Orthogonal Arrays of Index More Than One Orthogonal Arrays of Strength More Than Two Pairwise Balanced Designs PBDs and GDDs: The Basics PBDs: Recursive Constructions PBD-Closure Pairwise Balanced Designs as Linear Spaces PBDs and GDDs of Higher Index PBDs, Frames, and Resolvability Other Combinatorial Designs Association Schemes Balanced (Part) Ternary Designs Balanced Tournament Designs Bhaskar Rao Designs Complete Mappings and Sequencings of Finite Groups Configurations Costas Arrays Coverings Cycle Systems Difference Families Difference Matrices Difference Sets: Abelian Difference Sets: Nonabelian Difference Triangle Sets Directed Designs D-Optimal Matrices Embedding Partial Quasigroups Equidistant Permutation Arrays Factorial Designs Frequency Squares Generalized Quadrangles Graph Decompositions and Designs Graphical Designs Hadamard Matrices and Designs Hall Triple Systems Howell Designs Maximal Sets of MOLS Mendelsohn Designs The Oberwolfach Problem Ordered Designs and Perpendicular Arrays Orthogonal Designs Orthogonal Main Effect Plans Packings Partial Geometries Partially Balanced Incomplete Block Designs Quasigroups Quasi-Symmetric Designs (r,l)-Designs Room Squares Self-Orthogonal Latin Squares (SOLS) SOLS with a Symmetric Orthogonal Mate (SOLSSOM) Sequences with Zero Autocorrelation Skolem Sequences Spherical t-Designs Starters Trades and Defining Sets (t,m,s)-Nets Tuscan Squares t-Wise Balanced Designs Uniformly Resolvable Designs Vector Space Designs Weighing Matrices and Conference Matrices Whist Tournaments Youden Designs, Generalized Youden Squares Applications Codes Computer Science: Selected Applications Applications of Designs to Cryptography Derandomization Optimality and Efficiency: Comparing Block Designs Group Testing Scheduling a Tournament Winning the Lottery Related Mathematics and Computational Methods Finite Groups and Designs Number Theory and Finite Fields Graphs and Multigraphs Factorizations of Graphs Strongly Regular Graphs Two-Graphs Classical Geometries Projective Planes, Nondesarguesian Computational Methods in Design Theory Index

Review :
"…this Handbook is so useful (because) it contains the best current information on a very wide range of subjects." -The Mathematical Gazette, March 1997