Super-simple BIBDs with block size 4 and index 7
From MaRDI portal
Publication:2005681
DOI10.1016/j.disc.2020.112089zbMath1448.05022OpenAlexW3080196175MaRDI QIDQ2005681
Publication date: 8 October 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112089
Related Items (5)
\(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs ⋮ The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$ ⋮ Decomposable super‐simple BIBDs with block size 4 and index 4, 6 ⋮ Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes ⋮ Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
- Super-simple \((v,5,4)\) designs
- Super-simple balanced incomplete block designs with block size 4 and index 5
- Super-simple (\(v\),\,5,\,2)-designs.
- Super-simple balanced incomplete block designs with block size 4 and index 6
- On the existence of super-simple \((v,4,4)\)-BIBDs
- Super-simple balanced incomplete block designs with block size 4 and index 9
- Super-simple balanced incomplete block designs with block size 5 and index 3
- Super-simple Steiner pentagon systems
- Super-simple \((\nu, 5, 5)\) designs
- New upper bounds on the minimum size of covering designs
- On optimal superimposed codes
- Decomposable super‐simple NRBIBDs with block size 4 and index 6
- A combinatorial construction for perfect threshold schemes
- Decomposable super‐simple RBIBDs with block size 4 and index 6
- Super-simple designs with \(v\leq 32\)
This page was built for publication: Super-simple BIBDs with block size 4 and index 7
