Combinatorial Designs
From MaRDI portal
Publication:4441040
DOI10.1007/b97564zbMath1031.05001OpenAlexW4251007617MaRDI QIDQ4441040
Publication date: 30 December 2003
Full work available at URL: https://doi.org/10.1007/b97564
symmetric designHadamard matrixbalanced incomplete block designpairwise balanced designLatin squareorthogonal arraycombinatorial designs
Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Entry-faithful 2-neighbour transitive codes ⋮ Balanced semi-Latin rectangles: properties, existence and constructions for block size two ⋮ A modular first formalisation of combinatorial design theory ⋮ A scalable post-quantum hash-based group signature ⋮ New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8 ⋮ 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 ⋮ 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 ⋮ A construction of optimal constant composition codes ⋮ Decentralized asset custody scheme with security against rational adversary ⋮ \(\text{ALR}^n\): accelerated higher-order logistic regression ⋮ Group divisible designs with block size five from Clatworthy's table ⋮ On the combinatorial design of data centre network topologies ⋮ Distance-regular graphs with small number of distinct distance eigenvalues ⋮ Three-class association schemes from partial geometric designs ⋮ Algebraic properties of the canonical incidence matrix of a biplane ⋮ On transitive parallelisms of \(\mathrm{PG}(3,4)\) ⋮ A strongly regular decomposition of the complete graph and its association scheme ⋮ Difference systems of sets based on cosets partitions ⋮ A survey and refinement of repairable threshold schemes ⋮ 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 ⋮ Resolvable block designs in construction of approximate real MUBs that are sparse ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ On the Wilson monoid of a pairwise balanced design ⋮ 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 ⋮ Additional constructions to solve the generalized Russian cards problem using combinatorial designs ⋮ Key predistribution schemes for distributed sensor networks via block designs ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Combinatorial repairability for threshold schemes ⋮ Two classes of optimal two-dimensional OOCs ⋮ 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 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 ⋮ Topological designs ⋮ Hamilton cycles in restricted block-intersection graphs ⋮ A unified approach to combinatorial key predistribution schemes for sensor networks ⋮ Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 ⋮ A mathematical programming approach to the construction of BIBDs ⋮ Weakly Hadamard diagonalizable graphs ⋮ Constructions of covering arrays of strength five ⋮ A geometric protocol for cryptography with cards ⋮ Optimization problems with orthogonal matrix constraints ⋮ Egalitarian Steiner triple systems for data popularity ⋮ A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues ⋮ Asymptotic existence of frame-GBTDs ⋮ Codes, cubes, and graphical designs ⋮ LDPC codes from \(\mu\)-geodetic graphs obtained from block designs ⋮ On the synthesis of systems possessing the structure of some combinatorial designs ⋮ Polynomial criterion for abelian difference sets ⋮ On traceability property of equidistant codes ⋮ Hadamard matrices and the spectrum of quadratic symmetric polynomials over finite fields ⋮ A generalization of combinatorial designs and related codes ⋮ Pancyclic PBD block-intersection graphs ⋮ A construction of group divisible designs with block sizes 3 to 7 ⋮ A feasibility approach for constructing combinatorial designs of circulant type ⋮ Application of combinatorial interaction design for DC servomotor PID controller tuning ⋮ Compression of periodic complementary sequences and applications ⋮ On the Cameron-Praeger conjecture ⋮ Block-transitive designs in affine spaces ⋮ Resolvable configurations ⋮ A family of group divisible designs with arbitrary block sizes ⋮ A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme ⋮ Key pre-distribution in a non-uniform rectangular grid for wireless sensor networks ⋮ On the integrability of strongly regular graphs ⋮ Partial Geometric Difference Families ⋮ Frame difference families and resolvable balanced incomplete block designs ⋮ Some results on generalized strong external difference families ⋮ Minimization and estimation of the variance of prediction errors for cross-validation designs ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ Generalized mix functions and orthogonal equitable rectangles ⋮ Minimal binary 2-neighbour-transitive codes ⋮ Novák's conjecture on cyclic Steiner triple systems and its generalization ⋮ Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes ⋮ Construction of mixed orthogonal arrays with high strength ⋮ On split graphs with four distinct eigenvalues ⋮ Three Steps ⋮ Constructions of optimal orthogonal arrays with repeated rows ⋮ New Regular Parallelisms of PG(3, 5) ⋮ Transversals in \(m \times n\) arrays ⋮ Structured Hadamard Conjecture ⋮ Linked systems of symmetric group divisible designs of type. II ⋮ Almost designs and their links with balanced incomplete block designs ⋮ Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ Partial geometric designs from group actions ⋮ On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\) ⋮ 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 polynomial ideal associated to any $t$-$(v,k,\lambda)$ design ⋮ ZERO-ANNIHILATOR 3-UNIFORM HYPERGRAPHS ASSOCIATED WITH RIGHT TERNARY NEAR-RINGS ⋮ Resilient Vectorial Functions and Cyclic Codes Arising from Cellular Automata ⋮ Unnamed Item ⋮ Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations ⋮ 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 ⋮ Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms ⋮ A cryptographic and coding-theoretic perspective on the global rules of cellular automata ⋮ A survey of metaheuristic algorithms for the design of cryptographic Boolean functions ⋮ 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 ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Inversion of Mutually Orthogonal Cellular Automata ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ On t‐designs and s‐resolvable t‐designs from hyperovals ⋮ The localization number of designs ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ New results on orthogonal arrays \(\mathrm{OA}(3,5,4n+2)\) ⋮ Fermat's method of factorisation ⋮ On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata ⋮ Mutually Disjoint 5‐Designs and 5‐Spontaneous Emission Error Designs from Extremal Ternary Self‐Dual Codes ⋮ Unnamed Item ⋮ Spectral properties of the binary Hadamard matrices ⋮ On some p-almost Hadamard matrices ⋮ On improving the construction of balanced incomplete block designs using planar near-rings
