2022
DOI: 10.1002/jcd.21835
|View full text |Cite
|
Sign up to set email alerts
|

Decomposable super‐simple BIBDs with block size 4 and index 4, 6

Abstract: Decomposable designs are important combinatorial designs, and have applications in constant weight codes, perfect threshold schemes and graph decompositions. Let λ $\lambda $ be an even positive integer. A λ 2 $\frac{\lambda }{2}$‐decomposable super‐simple ( v , k , λ ) $(v,k,\lambda )$‐balanced incomplete block design (BIBD) is a super‐simple ( v , k , λ ) $(v,k,\lambda )$‐BIBD, ( V , ℬ ) $(V,{\rm{ {\mathcal B} }})$, where ℬ = MJX-tex-caligraphicnormalℬ 1 ∪ MJX-tex-caligraphicnormalℬ 2 ${\rm{ {\mathcal … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(15 citation statements)
references
References 36 publications
0
15
0
Order By: Relevance
“…For u = 59 and 62, 2-decomposable super-simple (4, 4)-GDDs of types 15 12 5 1 and 4 7 6 1 exist from Lemma 2.5 [23], and super-simple (4, 2)-GDDs of types 2 4 and 6 4 exist from Lemma 1.2. So 4-decomposable super-simple (4, 8)-GDDs of types 30 24 5 1…”
Section: Proof Ofmentioning
confidence: 96%
See 4 more Smart Citations
“…For u = 59 and 62, 2-decomposable super-simple (4, 4)-GDDs of types 15 12 5 1 and 4 7 6 1 exist from Lemma 2.5 [23], and super-simple (4, 2)-GDDs of types 2 4 and 6 4 exist from Lemma 1.2. So 4-decomposable super-simple (4, 8)-GDDs of types 30 24 5 1…”
Section: Proof Ofmentioning
confidence: 96%
“…The following results also will be used in the sequel. Lemma 1.3 (Adams et al [5], Chen et al [23,24], and Zhang and Ge [40]). There exists a…”
Section: There Exists Amentioning
confidence: 99%
See 3 more Smart Citations