Abstract
If the row–column intersections of a row–column design A form a balanced incomplete block design, then A is said to be balanced for intersection. This property was originally defined for triple arrays by McSorley et al. (2005a), Section 8, where an example was presented and questions of existence were raised and discussed. We give sufficient conditions for the class of balanced grids in order to be balanced for intersection, and prove that a family of binary pseudo-Youden designs has this property.
Sign-in/Register to access full text options 
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.
