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
Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs
TL;DR: This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs and demonstrates that the proposed algorithm is competitive with the existing algorithms.
17
Hypergraph-Based Binary Locally Repairable Codes With Availability
Jung Hyun Kim,Hong-Yeop Song +1 more
TL;DR: A hypergraph-based code construction for binary locally repairable codes (LRCs) with availability is studied and a well-known Singleton-like bound with equality is achieved.
16
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Elizabeth Maltais,Lucia Moura +1 more
TL;DR: This paper proves that optimizing CAFEs and ELAs is indeed NP-hard even when restricted to the case of binary alphabets, using a reduction from edge clique covers of graphs (ECCs), and provides a hardness of approximation result.
16
•Posted Content
Optimal Las Vegas Locality Sensitive Data Structures
TL;DR: In this article, it was shown that approximate similarity search can be solved in high dimensions with performance matching state-of-the-art LSH, but with a guarantee of no false negatives.
16
Infinite families of 2-designs from linear codes
TL;DR: This paper first settles the weight distributions of two classes of linear codes, and then determines the parameters of infinite families of 2-designs held in these codes.
16
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