The following pages link to Combinatorial Designs (Q4441040):
Displaying 50 items.
- Minimization and estimation of the variance of prediction errors for cross-validation designs (Q146416) (← links)
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime (Q325819) (← links)
- \(\text{ALR}^n\): accelerated higher-order logistic regression (Q331666) (← links)
- On transitive parallelisms of \(\mathrm{PG}(3,4)\) (Q371236) (← links)
- Difference systems of sets based on cosets partitions (Q383644) (← links)
- Determination of the sizes of optimal \((m,n,k,\lambda,k-1)\)-OOSPCs for \(\lambda=k-1, k\) (Q389484) (← links)
- A colouring protocol for the generalized Russian cards problem (Q391146) (← links)
- Design and analysis of periodic multiple seeds (Q393900) (← links)
- Better spaced seeds using quadratic residues (Q394336) (← links)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs (Q406700) (← links)
- Two classes of optimal two-dimensional OOCs (Q411483) (← links)
- A geometric protocol for cryptography with cards (Q488255) (← links)
- Asymptotic existence of frame-GBTDs (Q498123) (← links)
- On traceability property of equidistant codes (Q507497) (← links)
- A generalization of combinatorial designs and related codes (Q510407) (← links)
- Hamilton cycles in restricted block-intersection graphs (Q648070) (← links)
- Constructions of covering arrays of strength five (Q663479) (← links)
- Balanced semi-Latin rectangles: properties, existence and constructions for block size two (Q828486) (← links)
- A scalable post-quantum hash-based group signature (Q831185) (← links)
- New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8 (Q832002) (← links)
- A construction of optimal constant composition codes (Q851744) (← links)
- On a symmetric representation of Hermitian matrices and its applications to graph theory (Q896012) (← links)
- Matching divisible designs with block size four (Q898140) (← links)
- \(\operatorname{GDD}(n, 2, 4; \lambda_1, \lambda_2)\) with equal number of even and odd blocks (Q906482) (← links)
- On the Cameron-Praeger conjecture (Q966062) (← links)
- Block-transitive designs in affine spaces (Q970536) (← links)
- Generalized mix functions and orthogonal equitable rectangles (Q1008954) (← links)
- Combinatorial repairability for threshold schemes (Q1692160) (← links)
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 (Q1727364) (← links)
- Optimization problems with orthogonal matrix constraints (Q1735704) (← links)
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs (Q1741585) (← links)
- Hadamard matrices and the spectrum of quadratic symmetric polynomials over finite fields (Q1747114) (← links)
- A construction of group divisible designs with block sizes 3 to 7 (Q1752545) (← links)
- A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
- A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme (Q1787755) (← links)
- Frame difference families and resolvable balanced incomplete block designs (Q1801089) (← links)
- Some results on generalized strong external difference families (Q1801100) (← links)
- Key predistribution schemes for distributed sensor networks via block designs (Q1936501) (← links)
- A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues (Q1979376) (← links)
- Codes, cubes, and graphical designs (Q1982601) (← links)
- Polynomial criterion for abelian difference sets (Q1985932) (← links)
- Resolvable configurations (Q2026350) (← links)
- Novák's conjecture on cyclic Steiner triple systems and its generalization (Q2049450) (← links)
- Construction of mixed orthogonal arrays with high strength (Q2054534) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- Invariant codes, difference schemes, and distributive quasigroups (Q2099515) (← links)
- \(p\)-almost Hadamard matrices and \(\lambda\)-planes (Q2114776) (← links)
- On exclusive sum labellings of hypergraphs (Q2115164) (← links)
- Backtrack search for parallelisms of projective spaces (Q2115893) (← links)