The CRC handbook of combinatorial designs

zbMATH Open1101.05001MaRDI QIDQ3411976FDOQ3411976

Authors:

Publication date: 1 December 2006

Recommendations

Introduction to combinatorial designs
Combinatorial Designs
scientific article; zbMATH DE number 53917
scientific article; zbMATH DE number 863483
scientific article; zbMATH DE number 193109

Collections of articles of miscellaneous specific interest (00B15) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Designs and configurations (05Bxx)

Cited In (only showing first 100 items - show all)

Pairwise balanced designs with prescribed minimum dimension
The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
Four Mutually Orthogonal Latin Squares of Order 14
Mutually orthogonal rectangular gerechte designs
Optimum detecting arrays for independent interaction faults
Probabilistic existence of regular combinatorial structures
Self-dual codes from extended orbit matrices of symmetric designs
Multimagic rectangles based on large sets of orthogonal arrays
The equivalence between optimal detecting arrays and super-simple OAs
Further results on mutually nearly orthogonal Latin squares
Almost Hadamard matrices: the case of arbitrary exponents
The number of Latin squares of order 11
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
Constructions of new orthogonal arrays and covering arrays of strength three
Strongly regular graphs associated with ternary bent functions
A generalization of Hadamard matrices
Uniformly resolvable decompositions of $K_v$ into $K_2$ and $K_{1, 3}$ graphs
On automorphism groups of divisible designs acting regularly on the set of point classes
Two-weight codes, graphs and orthogonal arrays
Skew-Hadamard matrices of orders 436, 580, and 988 exist
On the existence of uniformly resolvable decompositions of $K_v$ and $K_v-I$ into paths and kites
Uniformly resolvable decompositions of $K_v$ into $P_3$ and $K_3$ graphs
Quantum codes from caps
Resolvable 3-star designs
On the number of transversals in Latin squares
Exotic complex Hadamard matrices and their equivalence
2-spreads and transitive and orthogonal 2-parallelisms of $PG(5, 2)$
Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
Orthogonal trades and the intersection problem for orthogonal arrays
Decompositions of complete graphs into circulants
Optimal two-level designs for partial profile choice experiments
Switching in one-factorisations of complete graphs
Maximum uniformly resolvable designs with block sizes 2 and 4
Graph-theoretic design and analysis of key predistribution schemes
On generalized Howell designs with block size three
Detecting arrays and their optimality
Self-dual codes from orbit matrices and quotient matrices of combinatorial designs
New tools for the construction of directed strongly regular graphs: difference digraphs and partial sum families
Improved bounds for separating hash families
Generalized packing designs
The existence of mixed orthogonal arrays with four and five factors of strength two
Cyclic $(v;r,s;\lambda)$ difference families with two base blocks and $v \leq 50$
On cyclic $G$-designs where $G$ is a cubic tripartite graph
Steiner equiangular tight frames
Round-robin tournaments with homogeneous rounds
Existence of super-simple $\mathrm{OA}_\lambda (3,5,v)$'s
Maximal partial transversals in a class of latin squares
Resolvable generalized difference matrices: existence and applications
On the $\mathrm{GF}(p)$ linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences
A class of cyclic $(v; k_{1}, k_{2}, k_{3}; \lambda)$ difference families with $v \equiv 3\, (\text{mod}\, 4)$ a prime
Constructions for new orthogonal arrays based on large sets of orthogonal arrays
Constructions of optimal GDRP$(n,\lambda ;v)$'s of type $\lambda^1\mu^{m - 1}$
A class of optimal constant composition codes from GDRPs
Polarities, quasi-symmetric designs, and Hamada's conjecture
Existence of $q$-analogs of Steiner systems
Orbit-disjoint regular $(n, 3, 1)$-CDPs and their applications to multilength OOCs
A unified approach to combinatorial key predistribution schemes for sensor networks
Some 20-regular CDP(5,1;20$u$) and their applications
On the existence of resolvable $(K_{3} + e)$-group divisible designs
Strongly regular graphs with non-trivial automorphisms
Signed graphs with three eigenvalues: biregularity and beyond
The projective general linear group $\mathrm{PGL}(2,2^m)$ and linear codes of length $2^m+1$
Galois geometries and coding theory
On regular signed graphs with three eigenvalues
Maximum uniformly resolvable decompositions of $K_v$ and $K_v - I$ into 3-stars and 3-cycles
Some combinatorial aspects of constructing bipartite-graph codes
Large sets of $t$-designs over finite fields
Orthogonally resolvable cycle decompositions
Divisible designs, Laguerre geometry, and beyond
On uniformly resolvable designs with block sizes 3 and 4
The spectrum for 3-way $k$-homogeneous Latin trades
A tight bound for frameproof codes viewed in terms of separating hash families
Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
Infinite families of 2-designs from linear codes
Oriented Steiner quasigroups.
Halton-type sequences from global function fields
The Hamilton-Waterloo problem with 4-cycles and a single factor of $n$-cycles
Enumeration of MOLS of small order
The Hamilton-Waterloo problem for cycle sizes 3 and 4
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Flag-transitive non-symmetric 2-designs with $(r,\lambda)=1$ and alternating socle
Self-complementary non-uniform hypergraphs
Unifying some known infinite families of combinatorial 3-designs
Minimum embedding of STSs into $(K_3+e)$-systems
$f$-vectors of pure complexes and pure multicomplexes of rank three
On the existence of orthogonal arrays OA$(3,5,4n+2)$
On relative $t$-designs in polynomial association schemes
Two unfortunate properties of pure $f$-vectors
A new upper bound on the parameters of quasi-symmetric designs
Generalized balanced tournament designs with block size four
On the codegree density of complete 3-graphs and related problems
Group divisible designs with two associate classes and $\lambda_{2}=1$
Group divisible designs with block size four and group type $g^um^{1}$ where $g$ is a multiple of 8
Exact embedding of two $G$-designs into a $(G+e)$-design
Switching codes and designs
A construction for $t$-fold perfect authentication codes with arbitration
On the directed Oberwolfach problem with equal cycle lengths
Non-existence of point-transitive $2$-$(106, 6, 1)$ designs
On the inclusion matrix $W_{23}(v)$
Additional constructions to solve the generalized Russian cards problem using combinatorial designs

This page was built for publication: The CRC handbook of combinatorial designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3411976)