English
Related papers

Related papers: Perfect Sequences and Arrays over the Unit Quatern…

200 papers

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

A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums (AACSs) for time-shifts within a certain region, called zero correlation zone (ZCZ). Optimal odd-length binary ZCPs (OB-ZCPs) display…

Information Theory · Computer Science 2019-09-24 Avik Ranjan Adhikary , Sudhan Majhi , Zilong Liu , Yong Liang Guan

In this paper three Schur ring are discussed, namenly: Hamming, circulant orbists and decimated circulant orbits Schur ring. By using autocorrelation function and the run structure of binary sequences we proof the relation between this…

Combinatorics · Mathematics 2018-07-31 Ronald Orozco López

An $m$-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation…

Information Theory · Computer Science 2022-03-23 Zhixiong Chen , Zhihua Niu , Yuqi Sang , Chenhuang Wu

Complex-valued periodic sequences, u, constructed by Goran Bjorck, are analyzed with regard to the behavior of their discrete periodic narrow-band ambiguity functions A_p(u). The Bjorck sequences, which are defined on Z/pZ for p>2 prime,…

Classical Analysis and ODEs · Mathematics 2011-07-12 John J. Benedetto , Robert L. Benedetto , Joseph T. Woodworth

Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…

Combinatorics · Mathematics 2026-03-20 Chris J Mitchell , Peter R Wild

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Guang Gong

Sequences with good correlation properties have been widely adopted in modern communications, radar and sonar applications. In this paper, we present our new findings on some constructions of single $H$-ary Golay sequence and $4^q$-QAM…

Information Theory · Computer Science 2011-06-24 Guang Gong , Fei Huo , Yang Yang

A general construction of a set of time-domain sequences with sparse periodic correlation functions, having multiple segments of consecutive zero-values, i.e. multiple zero correlation zones (ZCZs), is presented. All such sequences have a…

Information Theory · Computer Science 2020-07-17 Branislav M. Popovic , Peng Wang , Fredrik Berggren , Renaud-Alexandre Pitaval

In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period $2p$ and $2(2^n-1)$ with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009),…

Information Theory · Computer Science 2021-07-14 Minghui Yang , Shiyuan Qiang , Xiaoyan Jing , Keqin Feng , Dongdai Lin

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

Compared with the perfect complementary sequence sets, quasi-complementary sequence sets (QCSSs) can support more users to work in multicarrier CDMA communications. A near-optimal periodic QCSS is constructed in this paper by using an…

Information Theory · Computer Science 2017-07-18 Yu Li , Tongjiang Yan , Chuan Lv

The autocorrelation of a sequence is a useful criterion, among all, of resistance to cryptographic attacks. The behavior of the autocorrelations of random Boolean functions (studied by Florian Caullery, Eric F\'erard and Fran\c{c}ois Rodier…

Information Theory · Computer Science 2024-10-16 Florian Caullery , Eric F Érard , François Rodier

This paper presents a direct construction of an optimal symmetrical Z-complementary code set (SZCCS) of prime power lengths using a multi-variable function (MVF). SZCCS is a natural extension of the Z-complementary code set (ZCCS), which…

Information Theory · Computer Science 2023-05-03 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

This paper presents a novel class of complex-valued sparse complementary pairs (SCPs), each consisting of a number of zero values and with additional zero-correlation zone (ZCZ) property for the aperiodic autocorrelations and…

Information Theory · Computer Science 2023-05-02 Cheng-Yu Pai , Zilong Liu , Chunlei Li , Chao-Yu Chen

Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive…

Information Theory · Computer Science 2025-12-17 Tuvi Etzion

This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z-complementary pair (CZCP). The maximum possible ZCZ width…

Information Theory · Computer Science 2022-07-26 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…

Combinatorics · Mathematics 2018-11-08 María Carrasco , Zenaida Castillo , Nerio Borges , Ramón Pino Pérez

The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient…

Information Theory · Computer Science 2015-03-19 Tuvi Etzion

Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwenian sequences}, first with values $\pm 1$, then with values…

Number Theory · Mathematics 2021-03-23 J. -P. Allouche , G. -N. Han , H. Niederreiter