Combinatorial Designs
From MaRDI portal
Publication:4441040
DOI10.1007/b97564zbMath1031.05001MaRDI QIDQ4441040
Publication date: 30 December 2003
Full work available at URL: https://doi.org/10.1007/b97564
symmetric design; Hadamard matrix; balanced incomplete block design; pairwise balanced design; Latin square; orthogonal array; combinatorial designs
05B05: Combinatorial aspects of block designs
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05B15: Orthogonal arrays, Latin squares, Room squares
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
Related Items
Group divisible designs with block size five from Clatworthy's table, Minimization and estimation of the variance of prediction errors for cross-validation designs, Entry-faithful 2-neighbour transitive codes, 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, On transitive parallelisms of \(\mathrm{PG}(3,4)\), 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, Additional constructions to solve the generalized Russian cards problem using combinatorial designs, Two classes of optimal two-dimensional OOCs, A geometric protocol for cryptography with cards, Asymptotic existence of frame-GBTDs, On traceability property of equidistant codes, A generalization of combinatorial designs and related codes, Hamilton cycles in restricted block-intersection graphs, Constructions of covering arrays of strength five, 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, A construction of optimal constant composition codes, On a symmetric representation of Hermitian matrices and its applications to graph theory, Matching divisible designs with block size four, \(\operatorname{GDD}(n, 2, 4; \lambda_1, \lambda_2)\) with equal number of even and odd blocks, On the Cameron-Praeger conjecture, Block-transitive designs in affine spaces, Generalized mix functions and orthogonal equitable rectangles, 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, Partial Geometric Difference Families, New Regular Parallelisms of 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, Three Steps, MaxMinSum Steiner Systems for Access Balancing in Distributed Storage, Resilient Vectorial Functions and Cyclic Codes Arising from Cellular Automata, Unnamed Item, ZERO-ANNIHILATOR 3-UNIFORM HYPERGRAPHS ASSOCIATED WITH RIGHT TERNARY NEAR-RINGS, Unnamed Item, Optimal arrangements of classical and quantum states with limited purity, Set-Codes with Small Intersections and Small Discrepancies, Mutually Disjoint 5‐Designs and 5‐Spontaneous Emission Error Designs from Extremal Ternary Self‐Dual Codes, Spectral properties of the binary Hadamard matrices, On some p-almost Hadamard matrices, Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations, Fermat's method of factorisation, On improving the construction of balanced incomplete block designs using planar near-rings, A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design, The optimal bound on the 3-independence number obtainable from a polynomial-type method, Induced subgraphs of product graphs and a generalization of Huang's theorem, Constructions for new orthogonal arrays based on large sets of orthogonal arrays, Spot It!and balanced block designs: keys to better debate architecture for a plethora of candidates in presidential primaries?, Kite-group divisible packings and coverings with any minimum leave and minimum excess, Inversion of Mutually Orthogonal Cellular Automata, On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
