zbMATH — the first resource for mathematics

A computer search for complex Golay sequences. (English) Zbl 0818.05022
A complex Golay sequence (CGS) of length \(n\) is a pair \(a_ 1 a_ 2\dots a_ n\), \(b_ 1 b_ 2\dots b_ n\) of \((\pm 1, \pm i)\)-sequences which have zero autocorrelation \[ 0= \sum^ k_{j= 1} a_ j \overline a_{n- k+ j}+ \sum^ k_{j= 1} b_ j \overline b_{n- k+j}\quad\text{ for }k= 1,2,\dots, n- 1. \] The authors make computer search for CGS of length up to 13, and list all inequivalent CGS of length up to 13 (each length from 2 to 13 occurs).

05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.)
68R05 Combinatorics in computer science