English
Related papers

Related papers: Some New Balanced and Almost Balanced Quaternary S…

200 papers

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

Information Theory · Computer Science 2012-07-12 Cunsheng Ding

Binary Whiteman's cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman's generalized cyclotomic…

Information Theory · Computer Science 2015-09-28 Pramod Kumar Kewat , Priti Kumari

In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear…

Number Theory · Mathematics 2017-12-13 Vladimir Edemskiy

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…

Information Theory · Computer Science 2021-05-31 Qiuyue Liu , Shiyuan Qiang , Minghui Yang , Keqin Feng

New families of composition methods with processing of order 4 and 6 are presented and analyzed. They are specifically designed to be used for the numerical integration of differential equations whose vector field is separated into three or…

Numerical Analysis · Mathematics 2024-04-09 Sergio Blanes , Fernando Casas , Alejandro Escorihuela-Tomàs

The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…

Combinatorics · Mathematics 2024-08-27 Pierre Popoli , Manon Stipulanti

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

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

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking…

chao-dyn · Physics 2009-10-28 David K. Campbell , Roza Galeeva , Charles Tresser , David J. Uherka

In this paper we study pseudorandomness of a family of sequences in terms of two measures, the family complexity ($f$-complexity) and the cross-correlation measure of order $\ell$. We consider sequences not only on binary alphabet but also…

Information Theory · Computer Science 2024-05-08 Kenan Doğan , Murat Şahin , Oğuz Yayla

In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a…

Information Theory · Computer Science 2025-06-10 Chaofeng Guan , Ruihu Li , Jingjie Lv , Zhi Ma

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

Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…

Numerical Analysis · Mathematics 2024-11-15 Andrew Horning , Adam R. Gerlach

{\bf Abstract.} Considered is the distribution of the cross correlation between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences with…

Discrete Mathematics · Computer Science 2007-12-24 Tor Helleseth , Alexander Kholosha , Aina Johanssen

Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period…

Information Theory · Computer Science 2018-12-26 Kazuyoshi Tsuchiya , Chiaki Ogawa , Yasuyuki Nogami , Satoshi Uehara

Odd-frequency superconductivity describes a class of superconducting states where the superconducting gap is an odd function in relative time and Matsubara frequency. We present a group theoretical analysis based on the linearized gap…

Superconductivity · Physics 2018-01-17 R. Matthias Geilhufe , Alexander V. Balatsky

We present a new one parameter family of second derivative discontinuous solutions to the simplest scale invariant linear ordinary differential equation. We also point out how the construction could be extended to generate families of…

General Mathematics · Mathematics 2010-01-12 Dhurjati Prasad Datta , Manoj Kumar Bose

In this paper we study odd unimodal and odd strongly unimodal sequences. We use $q$-series methods to find several fundamental generating functions. Employing the Euler--Maclaurin summation formula we obtain the asymptotic main term for…

Number Theory · Mathematics 2023-08-23 Kathrin Bringmann , Jeremy Lovejoy