Combinatorial Designs
From MaRDI portal
orthogonal arraysymmetric designbalanced incomplete block designLatin squarepairwise balanced designHadamard matrixcombinatorial designs
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)- Design and analysis of periodic multiple seeds
- Better spaced seeds using quadratic residues
- Codes, cubes, and graphical designs
- Polynomial criterion for abelian difference sets
- Transversals in \(m \times n\) arrays
- Group divisible covering designs with block size 4: A type of covering array with row limit
- On split graphs with four distinct eigenvalues
- Invariant codes, difference schemes, and distributive quasigroups
- Backtrack search for parallelisms of projective spaces
- On equidistant single-orbit cyclic and quasi-cyclic subspace codes
- Balanced semi-Latin rectangles: properties, existence and constructions for block size two
- A scalable post-quantum hash-based group signature
- New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8
- Combinatorics of symmetric designs
- Design systems: Combinatorial characterizations of Delsarte I-designs via partially ordered sets
- Spectral properties of the binary Hadamard matrices
- Partial geometric designs from group actions
- A low-complexity algorithm to search for Legendre pairs
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- Two classes of optimal two-dimensional OOCs
- On the resolutions of cyclic Steiner triple systems with small parameters
- Block-transitive designs in affine spaces
- On graphs with equal total domination and Grundy total domination numbers
- Digraphs in which every t vertices have exactly common out-neighbors
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes
- \(p\)-almost Hadamard matrices and \(\lambda\)-planes
- Sparse PSD approximation of the PSD cone
- Pancyclic PBD block-intersection graphs
- Re-keying analysis in group key management of wireless sensor networks
- Linked systems of symmetric group divisible designs of type. II
- Entry-faithful 2-neighbour transitive codes
- On improving the construction of balanced incomplete block designs using planar near-rings
- On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\)
- Local unitary equivalence of absolutely maximally entangled states constructed from orthogonal arrays
- New results on large sets of orthogonal arrays and orthogonal arrays
- Hadamard matrices and the spectrum of quadratic symmetric polynomials over finite fields
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- scientific article; zbMATH DE number 3867331 (Why is no real title available?)
- Mutually disjoint 5-designs and 5-spontaneous emission error designs from extremal ternary self-dual codes
- On the integrability of strongly regular graphs
- Kramer-Mesner theorem: characterization of 2-designs through systems of Diophantine equations
- Design theory.
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
- Using combinatorial designs to construct partial concentrators
- A modular first formalisation of combinatorial design theory
- On the synthesis of systems possessing the structure of some combinatorial designs
- A construction of group divisible designs with block sizes 3 to 7
- A feasibility approach for constructing combinatorial designs of circulant type
- The optimal bound on the 3-independence number obtainable from a polynomial-type method
- Resilient vectorial functions and cyclic codes arising from cellular automata
- Applications of design theory for the constructions of MDS matrices for lightweight cryptography
- Three steps
- Set-codes with small intersections and small discrepancies
- Introduction to combinatorial designs
- Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
- The CRC handbook of combinatorial designs
- scientific article; zbMATH DE number 193109 (Why is no real title available?)
- Hadamard matrices: insights into their growth factor and determinant computations
- Fermat's method of factorisation
- On some p-almost Hadamard matrices
- On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
- A colouring protocol for the generalized Russian cards problem
- Quantum version of Euler's problem: a geometric perspective
- Weakly Hadamard diagonalizable graphs
- Almost perfect mutually unbiased bases that are sparse
- On the combinatorial design of data centre network topologies
- Tic-Tac-Toe on designs
- Egalitarian Steiner triple systems for data popularity
- Looms
- A family of group divisible designs with arbitrary block sizes
- Induced subgraphs of product graphs and a generalization of Huang's theorem
- Novák's conjecture on cyclic Steiner triple systems and its generalization
- A cryptographic and coding-theoretic perspective on the global rules of cellular automata
- scientific article; zbMATH DE number 770441 (Why is no real title available?)
- Group rings and character sums: tricks of the trade
- Some bounds arising from a polynomial ideal associated to any \(t\)-design
- Bounds on data limits for all-to-all comparison from combinatorial designs
- New regular parallelisms of \(\mathrm{PG}(3,5)\)
- Construction of \(\mathrm{GDD}(n_1, n_2, 4; \lambda, 1)\)
- On t‐designs and s‐resolvable t‐designs from hyperovals
- Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms
- Asymptotic existence of egalitarian Steiner 2-designs
- An efficient screening method for identifying parameters and interactions that impact wireless network performance
- MaxMinSum Steiner systems for access balancing in distributed storage
- A construction of optimal constant composition codes
- A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime
- Inversion of Mutually Orthogonal Cellular Automata
- Decentralized asset custody scheme with security against rational adversary
- Three-class association schemes from partial geometric designs
- Combinatorial designs with applications. Notes
- Improved hotplug caching schemes using PDAs and t-designs
- The construction of optimal orthogonal arrays with repeated rows and strength 2
- On existence theorems for simple \(t\)-designs
- Kolmogorov widths of balls in mixed norms: the case of rigidity
- Topological designs
- Structured Hadamard conjecture
- Algebraic design theory
- Resolvable configurations
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)
