Binary sequences with low correlation via cyclotomic function fields
share
Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the multiplicative cyclic group of _2^n. It is often overlooked in this community that all 2^n+1 rational places (including "place at infinity") of the rational function field over _2^n form a cyclic structure under an automorphism of order 2^n+1. In this paper, we make use of this cyclic structure to provide an explicit construction of families of binary sequences of length 2^n+1 via the finite field _2^n. Each family of sequences has size 2^n-1 and its correlation is upper bounded by ⌊ 2^(n+2)/2⌋. Our sequences can be constructed explicitly and have competitive parameters. In particular, compared with the Gold sequences of length 2^n-1 for even n, we have larger length and smaller correlation although the family size of our sequences is slightly smaller.
READ FULL TEXT