Relations between two perfect ternary sequence constructions (Q1203949)

A periodic sequence is called perfect if the periodic autocorrelation function is zero for all nonzero shifts of the sequence. A sequence is called ternary if it takes only the three values -1, 0, 1. \textit{V. P. Ipatov} [Radio Engin. Electron. Phys. 24, 75-79 (1979)] has constructed some perfect ternary sequences using shift register sequences over \(GF(q)\). Another class of perfect ternary sequences was constructed by \textit{R. A. Games} [IEEE Trans. Inf. Theory IT-32, 423-426 (1986; Zbl 0606.51010)] using difference sets and quadrics in finite projective spaces. The authors show that the Ipatov sequences are a subset of the Games sequences.