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
On the existence of 3 -way k -homogeneous Latin trades
TL;DR: A µ-way k-homogeneous Latin trade of volume s is a collection of µ partial Latin squares T 1, T 2,?, T µ, containing exactly the same s filled cells, such that, if cell (i, j ) is filled, it contains a different entry in each of the µ-particle Latin squares, and such that row i and column j similarly contain, set-wise, the same symbols as discussed by the authors.
4
f-vectors of pure complexes and pure multicomplexes of rank three
TL;DR: An upper bound on the number of sets of cardinality three is established using shifting arguments, and techniques from combinatorial design theory are used to establish a lower bound, and it is shown that every number of Sets of Cardinality three between the lower and the upper bound can be realized.
4
Constructing double- and triple-erasure-correcting codes with high availability using mirroring and parity approaches
Gang Wang,Xiaoguang Liu,Sheng Lin,Guangjun Xie,Jing Liu +4 more
- 05 Dec 2007
TL;DR: Simulation results show that, compared with other double- and triple-erasure codes, MPDC and MPPDC have comparative light-load and moderate- load performance and better heavy-load performance in fault-free mode and because parity declustering is used, the two codes are far superior in degraded- and reconstruction-mode performance.
4
Bounding the Independence Number in Some $$(n,k,\ell ,\lambda )$$ ( n , k , ℓ , λ ) -Hypergraphs
Fang Tian,Zi-Long Liu +1 more
TL;DR: It is shown that for any given positive integers 5, the independence number α(H) of H is the maximum size of a subset of vertices which contains no edges of H.
4
•Posted Content
Bounds on ordered codes and orthogonal arrays
TL;DR: In this paper, the size of codes and orthogonal arrays in the ordered Hamming space (the Niederreiter-Rosenbloom-Tsfasman space) was derived.
4
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