Open AccessBook
Handbook of Combinatorial Designs
Charles J. Colbourn,Jeffrey H. Dinitz +1 more
- 01 Jan 2006
863
TL;DR: In this paper, the authors present a design theory of small-block designs of small order for the first time in the last half of the 20th century, starting from the design of the first block designs in the early 1950s.
read more
Abstract: PREFACE INTRODUCTION NEW! Opening the Door NEW! Design Theory: Antiquity to 1950 BLOCK DESIGNS 2-(v, k, ?) Designs of Small Order NEW! Triple Systems BIBDs with Small Block Size t-Designs with t = 3 Steiner Systems Symmetric Designs Resolvable and Near-Resolvable Designs LATIN SQUARES Latin Squares Quasigroups Mutually Orthogonal Latin Squares (MOLS) Incomplete MOLS Self-Orthogonal Latin Squares (SOLS) 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 NEW! Group Divisible Designs PBDs, Frames, and Resolvability Pairwise Balanced Designs as Linear Spaces HADAMARD MATRICES AND RELATED DESIGNS Hadamard Matrices and Hadamard Designs Orthogonal Designs D-Optimal Matrices Bhaskar Rao Designs Generalized Hadamard Matrices Balanced Generalized Weighing Matrices and Conference Matrices Sequence Correlation Complementary, Base and Turyn Sequences NEW! Optical Orthogonal Codes OTHER COMBINATORIAL DESIGNS Association Schemes Balanced Ternary Designs Balanced Tournament Designs NEW! Bent Functions NEW! Block-Transitive Designs Complete Mappings and Sequencings of Finite Groups Configurations Correlation-Immune and Resilient Functions Costas Arrays NEW! Covering Arrays Coverings Cycle Decompositions Defining Sets NEW! Deletion-Correcting Codes Derandomization Difference Families Difference Matrices Difference Sets Difference Triangle Sets Directed Designs Factorial Designs Frequency Squares and Hypercubes Generalized Quadrangles Graph Decompositions NEW! Graph Embeddings and Designs Graphical Designs NEW! Grooming Hall Triple Systems Howell Designs NEW! Infinite Designs Linear Spaces: Geometric Aspects Lotto Designs NEW! Low Density Parity Check Codes NEW! Magic Squares Mendelsohn Designs NEW! Nested Designs Optimality and Efficiency: Comparing Block Designs Ordered Designs, Perpendicular Arrays and Permutation Sets Orthogonal Main Effect Plans Packings Partial Geometries Partially Balanced Incomplete Block Designs NEW! Perfect Hash Families NEW! Permutation Codes and Arrays NEW! Permutation Polynomials NEW! Pooling Designs NEW! Quasi-3 Designs Quasi-Symmetric Designs (r, ?)-designs Room Squares Scheduling a Tournament Secrecy and Authentication Codes Skolem and Langford Sequences Spherical Designs Starters Superimposed Codes and Combinatorial Group Testing NEW! Supersimple Designs Threshold and Ramp Schemes (t,m,s)-Nets Trades NEW! Turan Systems Tuscan Squares t-Wise Balanced Designs Whist Tournaments Youden Squares and Generalized Youden Designs RELATED MATHEMATICS Codes Finite Geometry NEW! Divisible Semiplanes Graphs and Multigraphs Factorizations of Graphs Computational Methods in Design Theory NEW! Linear Algebra and Designs Number Theory and Finite Fields Finite Groups and Designs NEW! Designs and Matroids Strongly Regular Graphs NEW! Directed Strongly Regular Graphs Two-Graphs BIBLIOGRAPHY INDEX
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Implementing logical connectives in constraint programming
TL;DR: A fast generic algorithm for reification using satisfying sets and movable triggers is presented, and it is proved that the Or algorithm enforces generalised arc consistency (GAC) when all its child constraints have a GAC propagator, and no variables are shared between children.
40
An Efficient Design and Implementation of the In-Parameter-Order Algorithm
TL;DR: This paper describes in detail how to efficiently design an efficient implementation, referred to as Fast In-Parameter-Order-General algorithm, which improves test generation times significantly while maintaining a low memory footprint compared to existing implementations.
39
•Posted Content
Hypergraph $F$-designs for arbitrary $F$
TL;DR: In this article, it was shown that the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete complete hypergraph into edge-disjoint copies of the original hypergraph.
37
Improvement of color quality and reduction of defects in the ink jet-printing technology for ceramic tiles production: A Design of Experiments study
Monia Montorsi,Consuelo Mugoni,Alessio Passalacqua,Andrea Annovi,Fabrizio Marani,Ludovica Fossa,Raffaele Capitani,Tiziano Manfredini +7 more
TL;DR: In this paper, the effect of different process parameters on the color and defects of tiles produced by ink-jet printing technology was investigated and the Design of Experiment approach was used to guarantee a rational planning of the experiments and to ensure objective conclusions through the statistical analysis of the data.
Test-Retest Reliability of Discrete Choice Experiment for Valuations of QLU-C10D Health States
Eva-Maria Gamper,Bernhard Holzner,Madeleine King,Richard Norman,Rosalie Viney,Virginie Nerich,Georg Kemmler +6 more
TL;DR: Results indicate that the designed DCE elicits stable health state preferences rather than guesses or mood-specific or condition-specific judgments, and the identified mean utility differences between test and retest need to be taken into account when determining minimal important differences for the QLU-C10D in future research.
35
Related Papers (5)
[...]
Thomas Beth,Dieater Jungnickel,Hanfried Lenz +2 more
- 01 Jan 1985
F.J. MacWilliams,Neil J. A. Sloane +1 more
- 01 Jan 1977
J. Dénes,A. D. Keedwell +1 more
- 01 Jan 1974
J.H. van Lint,Richard M. Wilson +1 more
- 01 Jan 1992