English
Related papers

Related papers: A Construction for Periodic ZCZ Sequences

200 papers

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

Information Theory · Computer Science 2017-03-28 Kelly T. R. Boothby , Daniel J. Katz

Completions of metric spaces are usually constructed using Cauchy sequences. However, this does not work for general uniform spaces, where Cauchy filters or nets must be used instead. The situation in pointfree topology is more…

General Topology · Mathematics 2025-09-29 Graham Manuell

Due to the zero nontrivial aperiodic correlation of complete complementary code (CCCs), it is used in asynchronous multi carrier code division multiple access (MC-CDMA) communication to provide zero interference performance. However, there…

Information Theory · Computer Science 2021-05-24 Bingsheng Shen , Yang Yang , Zhengchun Zhou

Let ${z_n}$ be a sequence in the unit disk ${z\in\mathbb{C}:|z|<1}$. It is known that there exists a unique positive Borel measure in the unit circle ${z\in\mathbb{C}:|z|=1}$ such that the orthogonal polynomials ${\Phi_n}$ satisfy…

Classical Analysis and ODEs · Mathematics 2011-09-21 María Pilar Alfaro , Manuel Bello-Hernández , Jesús María Montaner

In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can…

Information Theory · Computer Science 2021-05-24 Zhengchun Zhou , Fangrui Liu , Avik Ranjan Adhikary , Pingzhi Fan

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

Information Theory · Computer Science 2017-02-21 Qi Zhang , Jing Yang

Using a special metric in the space of sequences, we give a geometric description of almost periodic sets in the $k$-dimensional Euclidean space. We prove the completeness of the space of almost periodic sets and some analogue of the…

Metric Geometry · Mathematics 2010-02-02 S. Favorov , Ye. Kolbasina

Two arrays form a periodic complementary pair if the sum of their periodic autocorrelations is a delta function. Finding such pairs, however, is challenging for large arrays whose entries are constrained to a small alphabet. One such…

Signal Processing · Electrical Eng. & Systems 2020-04-29 Nitin Jonathan Myers , Robert W. Heath

In this work we study the solutions of the equation $z^pR(z^k)=\alpha$ with nonzero complex $\alpha$, integer $p,k$ and $R(z)$ generating a (possibly doubly infinite) totally positive sequence. It is shown that the zeros of…

Complex Variables · Mathematics 2017-05-25 Alexander Dyachenko

We examine the linear complexity and the autocorrelation properties of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four.

Information Theory · Computer Science 2013-05-17 Vladimir Edemskiy , Andrew Ivanov

Quaternary sequences of both even and odd period having low autocorrelation are studied. We construct new families of balanced quaternary sequences of odd period and low autocorrelation using cyclotomic classes of order eight, as well as…

Combinatorics · Mathematics 2017-11-08 Jerod Michel , Qi Wang

Whenever all differences between zeros of two holomorphic almost periodic functions in a strip form a discrete set, then both functions are infinite products of periodic functions with commensurable periods. In particular, the result is…

Complex Variables · Mathematics 2015-03-03 Sergii Yu. Favorov

For over three decades, the pursuit of perfect periodic autocorrelation sequences has been constrained by Mow's conjecture, which posits that no perfect sequence over an $n$-phase alphabet can exist with a length greater than $n^2$. While a…

Information Theory · Computer Science 2026-03-17 Sam Blake

The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…

Information Theory · Computer Science 2019-05-30 Christian Günther , Kai-Uwe Schmidt

We analyse a certain family of cellular integrals, which are period integrals on the moduli space $\mathcal{M}_{0,8}$ of curves of genus zero with eight marked points, and give rise to simultaneous rational approximations to $\zeta(3)$ and…

Number Theory · Mathematics 2026-01-30 Francis Brown , Wadim Zudilin

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

Information Theory · Computer Science 2016-02-12 Kai-Uwe Schmidt

The purpose of this note is to present a construction of sequences which do not have metric Poissonian pair correlations (MPPC) and whose additive energies grow at rates that come arbitrarily close to a threshold below which it is believed…

Number Theory · Mathematics 2021-01-12 Felipe A. Ramirez

In this work, we study the non-autonomous dynamics generated by random iterations of the cubic family of the form $z^3 + cz$. The parameter sequence is chosen randomly from a bounded Borel subset of $\mathbb{C}$. We investigate topological…

We construct a log algebraic version of the homotopy sequence for a quasi-projective normal crossing log variety over a log point of characteristic zero and prove some exactness properties of it. Our proofs are purely algebraic.

Algebraic Geometry · Mathematics 2018-05-22 Valentina Di Proietto , Atsushi Shiho

Quasi-complementary sequence sets (QCSSs) play an important role in multi-carrier code division multiple access (MC-CDMA) systems as they can support more users than perfect complementary sequence sets (PCSSs). The objective of this paper…

Information Theory · Computer Science 2025-03-19 Peng Wang , Ziling Heng , Chengju Li