English
Related papers

Related papers: Arithmetic crosscorrelation of binary $m$-sequence…

200 papers

The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for…

Information Theory · Computer Science 2015-03-13 Kai Cai

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We…

Combinatorics · Mathematics 2020-11-20 Makoto Araya , Masaaki Harada

Let $n_1$ and $n_2$ be two distinct primes with $\mathrm{gcd}(n_1-1,n_2-1)=4$. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order $4$. Our results show that this sequence can have very good…

Information Theory · Computer Science 2016-03-08 Priti Kumari , Pramod Kumar Kewat

Modelling multivariate circular time series is considered. The cross-sectional and serial dependence is described by circulas, which are analogs of copulas for circular distributions. In order to obtain a simple expression of the dependence…

Methodology · Statistics 2023-11-23 Hiroaki Ogata

Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…

Information Theory · Computer Science 2024-08-06 Xianhong Xie , Yaxin Zhao , Zhonghua Sun , Xiaobo Zhou

The period-doubling sequence is one of the most well-known aperiodic $0$-$1$ sequences. In this paper, a complete description of its symbolic recurrence plot is given, and formulas for asymptotic values of basic recurrence quantifiers are…

Dynamical Systems · Mathematics 2019-01-30 Vladimír Špitalský

The Hochschild and (cotriple) cyclic homologies of crossed modules of (not-necessarily-unital) associative algebras are investigated. Wodzicki's excision theorem is extended for inclusion crossed modules in the category of crossed modules…

K-Theory and Homology · Mathematics 2008-12-04 Guram Donadze , Nick Inassaridze , Emzar Khmaladze , Manuel Ladra

In this paper, we construct two binary linear codes associated with multi-dimensional and $m -$multiple power Kloosterman sums (for any fixed $m$) over the finite field $\mathbb{F}_{q}$. Here $q$ is a power of two. The former codes are dual…

Number Theory · Mathematics 2009-09-08 Dae San Kim

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

Combinatorics · Mathematics 2022-09-12 Michael De Vlieger , Thomas Scheuerle , Rémy Sigrist , N. J. A. Sloane , Walter Trump

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

We study the problem of finding a \textit{maximal} transitive relation contained in a given binary relation. Given a binary relation of size $m$ defined on a set of size $n$, we present a polynomial time algorithm that finds a maximal…

Data Structures and Algorithms · Computer Science 2018-05-24 Sourav Chakraborty , Shamik Ghosh , Nitesh Jha , Sasanka Roy

In this paper, new families of quadriphase sequences with larger linear span and size have been proposed and studied. In particular, a new family of quadriphase sequences of period $2^n-1$ for a positive integer $n=em$ with an even positive…

Information Theory · Computer Science 2011-01-19 Wenping Ma

We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…

Combinatorics · Mathematics 2017-08-15 Glenn Tesler

Given a finite simple graph $G$, let $\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G,…

We discuss the cyclic homology of crossed product algebras from the Cuntz-Quillen point of view. The periodic cyclic homology of a crossed product algebra $A\rtimes G$ is described in terms of the $G$-action on periodic cyclic bicomplexes…

K-Theory and Homology · Mathematics 2022-10-19 Michael Puschnigg

The associative spectrum of a groupoid (i.e., a set with a binary operation) measures its nonassociativity while the associative-commutative spectrum measures both nonassociativity and noncommutativity of the groupoid. The two spectra are…

Combinatorics · Mathematics 2024-12-02 Jia Huang , Erkko Lehtonen

In this paper, for an odd prime $p$ such that $p\equiv 3\bmod 4$, odd $n$, and $d=(p^n+1)/(p^k+1)+(p^n-1)/2$ with $k|n$, the value distribution of the exponential sum $S(a,b)$ is calculated as $a$ and $b$ run through $\mathbb{F}_{p^n}$. The…

Information Theory · Computer Science 2012-05-29 Sung-Tai Choi , Ji-Youp Kim , Jong-Seon No

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

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Combinatorics · Mathematics 2014-09-09 Jiangtao Peng , Fang Sun
‹ Prev 1 3 4 5 6 7 10 Next ›