English
Related papers

Related papers: Symmetric measures of pseudorandomness for binary …

200 papers

Symmetric elliptic integrals, which have been used as replacements for Legendre's integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When some of the variables are much larger than…

Classical Analysis and ODEs · Mathematics 2016-09-06 Bille C. Carlson , John L. Gustafson

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

Information Theory · Computer Science 2022-12-01 Xiaoyan Jing , Aixian Zhang , Keqin Feng

A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule as the Pascal triangle modulo 2. A binary Steinhaus triangle is said to be rotationally symmetric, horizontally symmetric or…

Discrete Mathematics · Computer Science 2022-04-20 Jonathan Chappelon

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

Information Theory · Computer Science 2024-04-30 Tingting Wu , Lanqiang Li , Xiuyu Zhang , Shixin Zhu

We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…

Social and Information Networks · Computer Science 2021-10-29 Tzu-Chi Yen

By a classical principle of probability theory, sufficiently thin subsequences of general sequences of random variables behave like i.i.d.\ sequences. This observation not only explains the remarkable properties of lacunary trigonometric…

Probability · Mathematics 2017-07-27 I. Berkes , R. Tichy

The quantum mechanical transition probability is symmetric. A probabilistically motivated and more general quantum logical definition of the transition probability was introduced in two preceding papers without postulating its symmetry, but…

Quantum Physics · Physics 2023-12-20 Gerd Niestegge

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low complexities. We present a new method of constructing CDMA sequence sets with the complexity of the Legendre from new frequency hop…

Cryptography and Security · Computer Science 2012-12-21 Anatolii Leukhin , Oscar Moreno , Andrew Tirkel

We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group $S_n$ and are consistent as $n$ varies. The extreme infinitely spherically symmetric permutation-valued processes are identified…

Probability · Mathematics 2016-11-08 Alexander Gnedin , Vadim Gorin

Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…

Information Theory · Computer Science 2022-10-25 Lingfei Jin , Liming Ma , Chaoping Xing

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

Information Theory · Computer Science 2021-07-27 Lingfei Jin , Liming Ma , Chaoping Xing

In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for $2^n$-periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed $k$-error cube…

Cryptography and Security · Computer Science 2014-08-12 Jianqin Zhou , Wanquan Liu , Xifeng Wang

Recently, Jiang et al. proposed several new classes of quaternary sequences with low autocorrelation and high linear complexity by using the inverse Gray mapping (JAMC, \textbf{69} (2023): 689--706). In this paper, we estimate the 4-adic…

Cryptography and Security · Computer Science 2024-01-09 Feifei Yan , Pinhui Ke , Lingmei Xiao

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

Computational Complexity · Computer Science 2024-01-22 Anuj Dawar , Gregory Wilsenach

The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…

Classical Analysis and ODEs · Mathematics 2011-07-25 S. Ali , F. M. Mahomed , Asghar Qadir

In this paper, we first introduce the concept of symmetric biderivation radicals and characteristic subalgebras of Lie algebras, and study their properties. Based on these results, we precisely determine biderivations of some Lie algebras…

Rings and Algebras · Mathematics 2025-04-30 Qiufan Chen , Yufeng Yao , Kaiming Zhao

This article provides the second part of the research initiated in arXiv:2411.17381, where we introduced and investigated so called periodicity shadows, which are special skew-symmetric matrices related to symmetric algebras with periodic…

Representation Theory · Mathematics 2024-12-05 Jerzy Białkowski , Adam Skowyrski

Real non-symmetric matrices may have either real or complex conjugate eigenvalues. These matrices can be seen to be pseudo-symmetric as $\eta M \eta^{-1} = M^t$, where the metric $\eta$ could be secular (a constant matrix) or depending upon…

Quantum Physics · Physics 2021-06-24 Sachin Kumar , Zafar Ahmed

The properties of precessing, coalescing binary black holes are presently inferred through comparison with two approximate models of compact binary coalescence. In this work we show these two models often disagree substantially when…

General Relativity and Quantum Cosmology · Physics 2018-01-03 A. R. Williamson , J. Lange , R. O'Shaughnessy , J. A. Clark , P. Kumar , J. Calderón Bustillo , J. Veitch
‹ Prev 1 4 5 6 7 8 10 Next ›