Abstract
Super-simple group divisible designs are useful for constructing other types of super-simple designs which can be applied to codes and designs. In this article, we investigate the existence of a super-simple (4,2)-GDD of type gu and show that such a design exists if and only if u⩾4, g(u−2)⩾4, g(u−1)≡0(mod3) and u(u−1)g2≡0(mod6).
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.
