Abstract
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple ( v , 4 , λ ) -BIBDs have been determined for λ = 2 – 6 . In this paper, we investigate the existence of a super-simple ( v , 4 , 9 ) -BIBD and show that such a design exists if and only if v ≡ 0 , 1 ( mod 4 ) and v ⩾ 20 . Applications of the results to optical orthogonal codes are also mentioned.
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.
