Group divisible designs with large block sizes
In this paper, the author showed that there is a \((k,\lambda_k)\)-GDD, group divisible design, of type \((q^{l+1}-q^l)^{(q^{n-l}-1)/(q-1)}\), for any prime power \(q\) and any integers \(k\), \(n\) with \(3\leq k \leq n\), where \(\lambda_k=\frac{\prod_{i=3}^{k-1}(q^n-q^{l+i-1})}{(k-2)!}\) and \(k+l\leq n+1\). The author generalized the \textit{C.-D. Lee} et al.'s method [ibid. 86, No. 6, 1281--1293 (2018; Zbl 1387.05024)] and used counting principles to construct such GDD. Moreover, the author showed that the conjecture given by C.-D. Lee at al. [loc. cit.] holds. It is a special case of the method given in this paper, for \(q=2\) and \(l=1\).
- Group divisible designs \(\mathsf{GDD}(n,n,n,1;\lambda_1,\lambda_2)\)
- A construction of group divisible designs with block sizes 3 to 7
- Group divisible designs with block size 4 where the group sizes are congruent to 2 mod 3
- scientific article; zbMATH DE number 5604333
- Group divisible designs with block size four and type gum1—III
- Balanced incomplete block designs and related designs
- Constructions of strictly m-cyclic and semi-cyclic H(m,n,4,3)
- scientific article; zbMATH DE number 1342086 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- Optimal constant weight codes over \(Z_k\) and generalized designs
- Some combinatorial constructions for optical orthogonal codes
- The CRC handbook of combinatorial designs
This page was built for publication: Group divisible designs with large block sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671638)
