Marco Buratti

Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

AbstractWe prove the existence of a cyclic (4p, 4, 1)-BIBD—and hence, equivalently, that of a cyclic (4, 1)-GDD of type 4p—for any prime

Recursive constructions for difference matrices and relative difference families

p \equiv 1{\text{ }}({\text{mod 6)}}

Constructions of ( q,k, 1) difference families with q a prime power and k =4,5

such that (p−1)/6 has a prime factor q not greater than 19. This was known only for q=2, i.e., for

Further progress on difference families with block size 4 or 5

p \equiv 1{\text{ }}({\text{mod 12)}}

On sharply vertex transitive 2-factorizations of the complete graph

. In this case an explicit construction was given for