Combinatorial Designs
From MaRDI portal
balanced incomplete block designcombinatorial designsHadamard matrixLatin squareorthogonal arraypairwise balanced designsymmetric design
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Recommendations
Cited in
(only showing first 100 items - show all)- Generalized mix functions and orthogonal equitable rectangles
- A survey of some problems in combinatorial designs - a matrix approach
- Minimization and estimation of the variance of prediction errors for cross-validation designs
- Combinatorial repairability for threshold schemes
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
- Optimization problems with orthogonal matrix constraints
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- Hadamard matrices and the spectrum of quadratic symmetric polynomials over finite fields
- A construction of group divisible designs with block sizes 3 to 7
- A feasibility approach for constructing combinatorial designs of circulant type
- A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme
- Frame difference families and resolvable balanced incomplete block designs
- Some results on generalized strong external difference families
- Key predistribution schemes for distributed sensor networks via block designs
- A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
- Codes, cubes, and graphical designs
- Polynomial criterion for abelian difference sets
- Resolvable configurations
- Novák's conjecture on cyclic Steiner triple systems and its generalization
- Construction of mixed orthogonal arrays with high strength
- On the classification of binary completely transitive codes with almost-simple top-group
- Invariant codes, difference schemes, and distributive quasigroups
- \(p\)-almost Hadamard matrices and \(\lambda\)-planes
- On exclusive sum labellings of hypergraphs
- Backtrack search for parallelisms of projective spaces
- Sparse PSD approximation of the PSD cone
- On graphs with equal total domination and Grundy total domination numbers
- A modular first formalisation of combinatorial design theory
- Decentralized asset custody scheme with security against rational adversary
- On the Wilson monoid of a pairwise balanced design
- Weakly Hadamard diagonalizable graphs
- Egalitarian Steiner triple systems for data popularity
- On the synthesis of systems possessing the structure of some combinatorial designs
- Application of combinatorial interaction design for DC servomotor PID controller tuning
- Compression of periodic complementary sequences and applications
- A family of group divisible designs with arbitrary block sizes
- On the integrability of strongly regular graphs
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes
- On split graphs with four distinct eigenvalues
- Constructions of optimal orthogonal arrays with repeated rows
- Transversals in \(m \times n\) arrays
- Linked systems of symmetric group divisible designs of type. II
- Almost designs and their links with balanced incomplete block designs
- Partial geometric designs from group actions
- On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\)
- On the combinatorial design of data centre network topologies
- Distance-regular graphs with small number of distinct distance eigenvalues
- Algebraic properties of the canonical incidence matrix of a biplane
- A strongly regular decomposition of the complete graph and its association scheme
- A survey and refinement of repairable threshold schemes
- Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
- On existence theorems for simple \(t\)-designs
- Lifted projective Reed-Solomon codes
- Topological designs
- A unified approach to combinatorial key predistribution schemes for sensor networks
- Pancyclic PBD block-intersection graphs
- Key pre-distribution in a non-uniform rectangular grid for wireless sensor networks
- Applications of design theory for the constructions of MDS matrices for lightweight cryptography
- Partial geometric designs with prescribed automorphisms
- Group divisible packings and coverings with any minimum leave and minimum excess
- Three-class association schemes from partial geometric designs
- Resolvable block designs in construction of approximate real MUBs that are sparse
- On the seven non-isomorphic solutions of the fifteen schoolgirl problem
- On inertia and ratio type bounds for the k-independence number of a graph and their relationship
- Design systems: Combinatorial characterizations of Delsarte I-designs via partially ordered sets
- Incidence matrices and inequalities for combinatorial designs
- Partial geometric difference families
- Combinatorial designs with applications. Notes
- Entry-faithful 2-neighbour transitive codes
- New regular parallelisms of \(\mathrm{PG}(3,5)\)
- Structured Hadamard conjecture
- Group divisible covering designs with block size 4: A type of covering array with row limit
- Orthogonally resolvable cycle decompositions
- A mathematical programming approach to the construction of BIBDs
- Algebraic design theory
- Three steps
- MaxMinSum Steiner systems for access balancing in distributed storage
- A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime
- \(\text{ALR}^n\): accelerated higher-order logistic regression
- scientific article; zbMATH DE number 3867331 (Why is no real title available?)
- Using combinatorial designs to construct partial concentrators
- Design theory
- The CRC handbook of combinatorial designs
- Design theory.
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- On transitive parallelisms of \(\mathrm{PG}(3,4)\)
- scientific article; zbMATH DE number 3948279 (Why is no real title available?)
- scientific article; zbMATH DE number 4008394 (Why is no real title available?)
- Difference systems of sets based on cosets partitions
- Determination of the sizes of optimal \((m,n,k,\lambda,k-1)\)-OOSPCs for \(\lambda=k-1, k\)
- A colouring protocol for the generalized Russian cards problem
- Design and analysis of periodic multiple seeds
- Better spaced seeds using quadratic residues
- scientific article; zbMATH DE number 45817 (Why is no real title available?)
- scientific article; zbMATH DE number 193109 (Why is no real title available?)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- Two classes of optimal two-dimensional OOCs
- Ordering block designs. Gray codes, universal cycles and configuration orderings
This page was built for publication: Combinatorial Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441040)
