Periodic Golay pairs and pairwise balanced designs (Q2114787): Difference between revisions

In this paper, a classification of periodic Golay pairs of length less than \(40\) is provided, making use of a relation between certain pairwise balanced designs with \(v\) points and periodic Golay pairs of length \(v\). A pair \((a,b)\) of \(\{\pm 1\}\) sequences is a periodic Golay pair (PGP) if \[\sum_{i=0}^{v-1}a_i a_{i+s} + \sum_{i=0}^{v-1}b_i b_{i+s}=0\] for every shift \(s\), with \(0\leq s\leq v-1\). Periodic Golay pairs generalize Golay pairs, which are known to have applications in multi-slit spectroscopy, signal processing, digital communications, and other areas. PGPs exist at lengths where no Golay pairs may exist, and they also possess the properties required for the applications. In this paper, the authors construct pairwise balanced designs (PBDs) using orbit matrices, with suitable parameters and given cyclic automorphism group, and they use them to construct PGPs. They classify PBDs with these conditions which correspond to PGPs of length \(v\) for all \(v \leq 34\), and they observe that there are no periodic Golay pairs of length \(36\) and \(38\). Moreover, to complete the classification of PBDs and PGPs up to isomorphism, a suitable notion of isomorphism is introduced. Finally, the authors show how the PGPs constructed and their related orbit matrices can be used to construct quasi-cyclic self-orthogonal linear codes over suitable finite fields.