English
Related papers

Related papers: Partial direct product difference sets and sequenc…

200 papers

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

This paper aims to investigate the numerical approximation of semilinear non-autonomous stochastic partial differential equations (SPDEs) driven by multiplicative or additive noise. Such equations are more realistic than autonomous SPDEs…

Numerical Analysis · Mathematics 2020-11-18 Jean Daniel Mukam , Antoine Tambue

A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…

Combinatorics · Mathematics 2014-11-25 Martino Borello , Gabriele Nebe

An almost complete intersection ideal can be seen as a $d$-sequence ideal with the minimal number of generators being one more than its height. In this paper, we give exact formulas for the regularity of powers of graded almost complete…

Commutative Algebra · Mathematics 2024-12-02 Neeraj Kumar , Chitra Venugopal

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

Consider an elliptic self-adjoint pseudodifferential operator $A$ acting on $m$-columns of half-densities on a closed manifold $M$, whose principal symbol is assumed to have simple eigenvalues. Relying on a basis of pseudodifferential…

Analysis of PDEs · Mathematics 2022-01-12 Matteo Capoferri

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

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

Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…

Number Theory · Mathematics 2021-05-10 László Mérai , Arne Winterhof

We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a `$W$-product' $W(T,Y)$, where $T$ is a monoid, $Y$ is a semilattice and there is a…

Group Theory · Mathematics 2014-04-28 Peter R. Jones

We show that almost split sequences in the category of comodules over a coalgebra with finite-dimensional right-hand term are direct limits of almost split sequences over finite dimensional subcoalgebras. In previous work we showed that…

Representation Theory · Mathematics 2007-05-23 William Chin , Mark Kleiner , Declan Quinn

Doppler-resilient complementary sequence (DRCS) sets play a vital role in modern communication and sensing systems, particularly in high-mobility environments. This work makes two primary contributions. First, we refine the definition of…

Information Theory · Computer Science 2026-02-09 Zheng Wang , Zhiye Yang , Yang Yang , Avik Ranjan Adhikary , Keqin Feng

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

We study correlation estimates of automatic sequences (that is, sequences computable by finite automata) with polynomial phases. As a consequence, we provide a new class of good weights for classical and polynomial ergodic theorems, not…

Dynamical Systems · Mathematics 2018-03-21 Tanja Eisner , Jakub Konieczny

We examine the completely isometric automorphisms of a free product of noncommutative disc algebras. It will be established that such an automorphism is given simply by a completely isometric automorphism of each component of the free…

Operator Algebras · Mathematics 2015-07-01 Christopher Ramsey

For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…

Combinatorics · Mathematics 2024-07-29 Eric Swartz , James A. Davis , John Polhill , Ken W. Smith

A canonical Huffman sequence is characterized by a zero inner-product between itself and each of its shifted copies, except at their largest relative shifts: their aperiodic auto-correlation then becomes delta-like, a single central peak…

Combinatorics · Mathematics 2021-06-07 T. C. Petersen , D. M. Paganin , I. D. Svalbe

Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and…

Discrete Mathematics · Computer Science 2013-08-06 Carlos Araujo , Italo J. Dejter , Peter Horak

The generalized cyclotomic binary sequences $S=S(a, b, c)$ with period $n=pq$ have good autocorrelation property where $(a, b, c)\in \{0, 1\}^3$ and $p, q$ are distinct odd primes. For some cases, the sequences $S$ have ideal or optimal…

Information Theory · Computer Science 2021-05-25 Xiaoyan Jing , Shiyuan Qiang , Minghui Yang , Keqin Feng

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

Combinatorics · Mathematics 2023-01-24 Simone Costa , Stefano Della Fiore , M. A. Ollis