A family of group divisible designs with arbitrary block sizes (Q2279385): Difference between revisions

In this paper, the authors are interested in a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes. The paper can be seen as a continuation of the work started in [\textit{C.-D. Lee} et al., Des. Codes Cryptography 86, No. 6, 1281--1293 (2018; Zbl 1387.05024)]. In this research, the authors gave a construction of GDDs by assuming the sum of each error pattern to be any prescribed nonzero element \(\alpha\) instead of 1, and omitting the constraints for the sum of a proper subset \(S\) of \(x_1, \dots,x_k\). The obtained GDDs are similar to the ones constructed in [loc. cit.], for \(k=3,4\), but are different for \(k\geq 5\).