Perfect Gaussian integer sequences from cyclic difference sets
Xinjiao Chen, Chunlei Li, Chunming Rong
Abstract
Xinjiao Chen, Chunlei Li, Chunming Rong
Abstract
A Gaussian integer is a complex number whose real and imaginary parts are both integers. This paper proposed a unified construction of perfect Gaussian integer sequences based on cyclic difference sets. It turns out that this construction produces an abundance of perfect Gaussian integer sequences. The proposed construction includes all the sequences recently given by Lee et. al as special cases, and many new families of Gaussian integer sequences. To illustrate, two classes of perfect Gaussian integer sequences defined from Kasami-Welch functions and Helleseth-Gong functions are given.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A Gaussian integer is a complex number whose real and imaginary parts are both integers. This paper proposed a unified construction of perfect Gaussian integer sequences based on cyclic difference sets. It turns out that this construction produces an abundance of perfect Gaussian integer sequences. The proposed construction includes all the sequences recently given by Lee et. al as special cases, and many new families of Gaussian integer sequences. To illustrate, two classes of perfect Gaussian integer sequences defined from Kasami-Welch functions and Helleseth-Gong functions are given.
Key concepts: Gaussian integer, Integer (computer science), Perfect power, Gaussian, Mathematics, Discrete mathematics, Combinatorics, Integer programming