Binary Sequences With a Low Correlation via Cyclotomic Function Fields

DOI10.1109/TIT.2022.3146267MaRDI QIDQ5088481zbMATH OpenOpenAlexFDO

Authors Lingfei Jin, Liming Ma, Chaoping Xing

Publication date 13 July 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.11766

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclotomic function fields (class groups, Bernoulli objects, etc.) (11R60)

Abstract: 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 $F_{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 $F_{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 $F_{2^n}$. Each family of sequences has size $2^n-1$ and its correlation is upper bounded by $lfloor{2}^{(n+2)/2}floor$. 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.

This page was built for publication: Binary Sequences With a Low Correlation via Cyclotomic Function Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088481)