English
Related papers

Related papers: A Construction for Periodic ZCZ Sequences

200 papers

The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for…

Information Theory · Computer Science 2021-09-29 Gaojun Luo , Martianus Frederic Ezerman , San Ling

A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other…

Information Theory · Computer Science 2014-01-14 Tongjiang Yan , Zhixiong Chen , Bao Li

In this paper, we study the sequences with (non-consecutive) two zero-symbols and ideal autocorrelation, which are also known as almost $m$-ary nearly perfect sequences. We show that these sequences are equivalent to $\ell$-partial direct…

Combinatorics · Mathematics 2020-05-27 Büşra Özden , Oğuz Yayla

One objective of this paper is to propose a novel class of sequence pairs, called "Quasi-orthogonal Z-complementary pairs (QOZCPs)", each depicting Z-complementary property for their aperiodic auto-correlation sums and also have a zero…

Information Theory · Computer Science 2020-05-05 Jiahuan Wang , Pingzhi Fan , Zhengchun Zhou , Yang Yang

Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence…

Information Theory · Computer Science 2020-07-16 Daniel J. Katz , Sangman Lee , Stanislav A. Trunov

In this paper, we first propose a new design strategy of 2D $Z$-complementary array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four distinct unimodular arrays satisfying zero 2D auto-correlation sums for non-trivial…

Information Theory · Computer Science 2023-08-15 Shibsankar Das , Adrish Banerjee , Udaya Parampalli

Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…

Information Theory · Computer Science 2020-10-22 Avik Ranjan Adhikary , Yanghe Feng , Zhengchun Zhou , Pingzhi Fan

Sequences with good randomness properties are quite important for stream ciphers. In this paper, a new class of quaternary sequences is constructed by using generalized cyclotomic classes of $\mathbb{Z}_{2p^m}$ $(m\geq1)$. The exact values…

Information Theory · Computer Science 2023-09-11 Qiuyan Wang , Weigang Kong , Yang Yan , Chenhuang Wu , Minghui Yang

We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…

Information Theory · Computer Science 2024-08-27 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

We present a general review of the bifurcation sequences of periodic orbits in general position of a family of resonant Hamiltonian normal forms with nearly equal unperturbed frequencies, invariant under $Z_2 \times Z_2$ symmetry. The rich…

Dynamical Systems · Mathematics 2016-06-28 Antonella Marchesiello , Giuseppe Pucacco

This paper aims to search for new optimal and sub-optimal Odd Binary Z-Complimentary Pairs (OBZCPs) for lengths up to 49. As an alternative to the celebrated binary Golay complementary pairs, optimal OBZCPs are the best almost-complementary…

Information Theory · Computer Science 2024-11-14 Peter Kazakov , Zilong Liu

The ground states of the Bernasconi model are binary +1/-1 sequences of length N with low autocorrelations. We introduce the notion of perfect sequences, binary sequences with one-valued off-peak correlations of minimum amount. If they…

Disordered Systems and Neural Networks · Physics 2009-10-30 Stephan Mertens , Christine Bessenrodt

In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…

Information Theory · Computer Science 2019-05-09 Jinquan Luo , Junru Ma

The concept of a sequence of exact zero-divisors on a noetherian local ring is defined and studied. Some properties of sequences of exact zero-divisors are compared with regular sequences.

Commutative Algebra · Mathematics 2012-04-24 Mohammad T. Dibaei , Mohsen Gheibi

Sequences with low aperiodic autocorrelation and crosscorrelation are used in communications and remote sensing. Golay and Shapiro independently devised a recursive construction that produces families of complementary pairs of binary…

Information Theory · Computer Science 2021-11-16 Daniel J. Katz , Courtney M. van der Linden

Binary sequences with good autocorrelation properties and large linear complexity are useful in stream cipher cryptography. The Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences have nearly optimal autocorrelation. However, the problem of…

Information Theory · Computer Science 2016-02-19 Şaban Alaca , Goldwyn Millar

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$…

Combinatorics · Mathematics 2018-12-24 Büşra Özden , Oğuz Yayla

It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of…

Information Theory · Computer Science 2016-07-07 Daniel J. Katz