Pairwise balanced designs related to Periodic Golay pairs

In this talk we give a relation between certain pairwise balanced designs (PBDs) with v points and periodic Golay pairs (PGPs) of length v. Using this connection, we classify PGPs of length less than 40 and construct new PGPs of lengths greater than 40 where classifications remain incomplete. Further, we show that under certain conditions the incidence and orbit matrices of PBDs related to PGPs span quasi-cyclic self-orthogonal codes.