The CRC handbook of combinatorial designs
From MaRDI portal
Publication:3411976
zbMATH Open1101.05001MaRDI QIDQ3411976FDOQ3411976
Authors:
Publication date: 1 December 2006
Recommendations
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)
- Doubly resolvable 4-cycle systems of \(2K_v\)
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- Flag-transitive point-quasiprimitive 2-\((v,\, k,\, 2)\) designs
- A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
- Combinatorial constructions of packings in Grassmannian spaces
- Sets of mutually orthogonal Sudoku frequency squares
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- Generalizing pairs of complementary sequences and a construction of combinatorial structures
- Line spreads of PG(5, 2)
- New invariants for incidence structures
- Completely reducible super-simple designs with block size four and related super-simple packings
- Super-simple balanced incomplete block designs with block size 5 and index 3
- Additivity of affine designs
- Flag-transitive \(2\)-\((\upsilon , 5, \lambda )\) designs with sporadic socle
- Enhancing set constraint solvers with lexicographic bounds
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- Classification of flag-transitive point-primitive non-symmetric 2-\((v, k, \lambda)\) designs with \(v < 100\)
- Heffter arrays and biembedding graphs on surfaces
- Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
- A simple approach to constructing quasi-Sudoku-based sliced space-filling designs
- Introduction to combinatorial designs
- Bachelor Latin squares with large indivisible plexes
- The 3-GDDs of type \(g^3u^2\)
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Constructing ordered orthogonal arrays via sudoku
- Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
- Optimum mixed level detecting arrays
- Toward the classification of biangular harmonic frames
- On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\)
- A survey on the problems and algorithms for covering arrays via set covers
- Combinational constructions of splitting authentication codes with perfect secrecy
- Note on the tight relative 2-designs on \(H(n,2)\)
- New partitionings of complete designs
- Maximal arcs in projective planes of order 16 and related designs
- Incomplete group divisible designs with block size four and general index
- Weight distribution of preparata codes over \(Z_4\) and the construction of 3-designs
- The spectrum for overlarge sets of hybrid triple systems
- On the existence of holey 4-cycle frames
- Two series of equitable symbol weight codes meeting the Plotkin bound
- Some constructions for \(t\) pairwise orthogonal diagonal Latin squares based on difference matrices
- Miklós-Manickam-Singhi conjectures on partial geometries
- Exponential bounds on the number of designs with affine parameters
- Hadamard matrices of small order and Yang conjecture
- On the existence of cycle frames and almost resolvable cycle systems
- Almost perfect and planar functions
- Completely reducible super-simple designs with block size five and index two
- Mutually orthogonal equitable Latin rectangles
- A new combinatorial approach to the construction of constant composition codes
- Optimal grid holey packings with block size 3 and 4
- CLASSIFICATION OF NEAR-NORMAL SEQUENCES
- Asymptotic existence of frame-GBTDs
- Strongly regular graphs constructed from \(p\)-ary bent functions
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- Cocyclic Hadamard matrices from forms over finite Frobenius rings
- Generalized mix functions and orthogonal equitable rectangles
- On orthogonal generalized equitable rectangles
- The existence of generalized mix functions
- Commutative association schemes
- Families of optimal packings in real and complex Grassmannian spaces
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- Mixed covering arrays of strength three with few factors
- Flag-transitive \(2\)-\((v, k, \lambda)\) symmetric designs with \(\lambda \geq (k, \lambda)^2\) and alternating socle
- A subspace covering problem in the \(n\)-cube
- \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
- Extending permutation arrays: improving MOLS bounds
- Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
- Square integer Heffter arrays with empty cells
- Further results on the existence of splitting BIBDs and application to authentication codes
- Constructions of biangular tight frames and their relationships with equiangular tight frames
- Existence of \(t\) strongly symmetric pairwise orthogonal diagonal Latin squares for \(t\in\{3,4,5\}\)
- Flag-transitive 2-designs with \((r - \lambda ,k)=1\) and alternating socle
- Zero-sum flows for Steiner systems
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
- Archimedean graph designs. II.
- 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
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)
