Generalized balanced tournament designs with block size four
From MaRDI portal
Summary: In this paper, we remove the outstanding values \(m\) for which the existence of a GBTD\((4,m)\) has not been decided previously. This leads to a complete solution to the existence problem regarding GBTD\((4,m)\)s.
Recommendations
- Near generalized balanced tournament designs with block sizes 4 and 5
- Generalized Balanced Tournament Designs
- Constructions for generalized balanced tournament designs
- Existence results for generalized balanced tournament designs with block size 3
- On near generalized balanced tournament designs
- Balanced ternary designs with block size four
- scientific article; zbMATH DE number 3941552
- The existence of partitioned generalized balanced tournament designs with block size 3
- scientific article; zbMATH DE number 3968601
Cites work
- A class of optimal constant composition codes from GDRPs
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- Existence results for generalized balanced tournament designs with block size 3
- Generalized Balanced Tournament Designs
- Generalized balanced tournament designs and related codes
- scientific article; zbMATH DE number 3621745 (Why is no real title available?)
- scientific article; zbMATH DE number 3438734 (Why is no real title available?)
- scientific article; zbMATH DE number 3797764 (Why is no real title available?)
- On furnishing Room squares
- The CRC handbook of combinatorial designs
Cited in
(4)
This page was built for publication: Generalized balanced tournament designs with block size four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396762)