English
Related papers

Related papers: A Construction for Perfect Periodic Autocorrelatio…

200 papers

We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…

Information Theory · Computer Science 2017-01-06 Sam Blake

We construct a family of perfect polyphase sequences that has the Frank sequences, Chu sequences, and Milewski sequences as special cases. This is not the most general construction of this type, but it has a particularly simple form. We…

Information Theory · Computer Science 2016-08-19 Idris Mercer

Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low…

Information Theory · Computer Science 2014-11-18 Tongjiang Yan , Guang Gong

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

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

Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…

Information Theory · Computer Science 2023-08-10 Dan Zhang , Staal A. Vinterbo

We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information…

Information Theory · Computer Science 2014-06-17 Honggang Hu

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

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

The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of…

Cryptography and Security · Computer Science 2018-01-29 Shidong Zhang , Tongjiang Yan

Let R be a perfect ring of characteristic p. We show that the group of continuous R-linear automorphisms of the perfect power series ring over R is generated by the automorphisms of the ordinary power series ring together with Frobenius;…

Rings and Algebras · Mathematics 2018-07-02 Kiran S. Kedlaya

In this paper, we present an alternative proof showing that the maximal aperiodic autocorrelation of the $m$-th Rudin-Shapiro sequence is of the same order as $\lambda^{m}$, where $\lambda$ is the real root of $x^{3} + x^{2} - 2x - 4$. This…

Combinatorics · Mathematics 2022-10-21 Daniel Tarnu

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

In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…

Cryptography and Security · Computer Science 2013-09-09 Hai Xiong , Longjiang Qu , Chao 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

We analyze the connection between the autocorrelation of a binary sequence and its run structure given by the run length encoding. We show that both the periodic and the aperiodic autocorrelation of a binary sequence can be formulated in…

Information Theory · Computer Science 2013-08-05 Jürgen Willms

Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popovi\'c, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper…

Information Theory · Computer Science 2026-01-21 Qin Yuan , Chunlei Li , Xiangyong Zeng

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…

Information Theory · Computer Science 2017-03-21 Yuhua Sun , Qiang Wang , Tongjiang Yan

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

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed…

Information Theory · Computer Science 2018-01-03 Cuiling Fan
‹ Prev 1 2 3 10 Next ›