Abstract
SYNOPTIC ABSTRACTSeveral methods for constructing generalized group divisible designs with two classes and blocksize three are presented. Two constructions of completely symmetric designs are also given. All of the constructed designs achieve a lower bound on the diagonal elements of their information matrices required for E- and MV-optimality arguments; for most of the designs these optimalities are established. Difference techniques and the finite fields play key roles, as do idempotent and half-idempotent Latin squares.
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 callMore From: American Journal of Mathematical and Management Sciences
Disclaimer: 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.
