Abstract
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Supersimple group divisible designs are useful in constructing other types of supersimple designs which can be applied to codes and designs. In this article, the existence of a super-simple (5, 4)-GDD of group type gu is investigated and it is shown that such a design exists if and only if u ⩾ 5, g(u − 2) ⩾ 12, and u(u − 1)g2 ≡ 0 (mod 5) with some possible exceptions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
