English
Related papers

Related papers: Boolean Functions of Binary Type-II and Type-II/II…

200 papers

The determination of the cross correlation between an $m$-sequence and its decimated sequence has been a long-standing research problem. Considering a ternary $m$-sequence of period $3^{3r}-1$, we determine the cross correlation…

Information Theory · Computer Science 2013-10-01 Tao Zhang , Shuxing Li , Tao Feng , Gennian Ge

{\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

This paper is the second in a series investigating cartesian closed varieties. In first of these, we showed that every non-degenerate finitary cartesian variety is a variety of sets equipped with an action by a Boolean algebra B and a…

Operator Algebras · Mathematics 2024-08-06 Richard Garner

We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.

Combinatorics · Mathematics 2023-03-15 Shoyu Nagaoka , Manabu Oura

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

Combinatorics · Mathematics 2016-08-16 J. Tharrats

A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…

Number Theory · Mathematics 2007-05-23 Giuseppe Melfi

In binary jumbled pattern matching we wish to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of size $i$ and has exactly $j$ 1-bits. The problem naturally generalizes to…

Data Structures and Algorithms · Computer Science 2014-07-01 Danny Hermelin , Gad M. Landau , Yuri Rabinovich , Oren Weimann

Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…

Information Theory · Computer Science 2022-04-08 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

In this paper we express the difference of two complementary Beatty sequences, as the sum of two Beatty sequences closely related to them. In the process we introduce a new Algorithm that generalizes the well known Minimum Excluded…

Number Theory · Mathematics 2023-05-25 Geremias Polanco

In this article, we carry out the investigation for regular sequences of symmetric polynomials in the polynomial ring in three and four variable. Any two power sum element in $\mathbb{C}[x_1,x_2,...,x_n]$ for $n \geq 3$ always form a…

Commutative Algebra · Mathematics 2013-03-26 Neeraj Kumar , Ivan Martino

In this article we study the pair correlation statistic for higher dimensional sequences. We show that for any $d\geq 2$, strictly increasing sequences $(a_n^{(1)}),\ldots, (a_n^{(d)})$ of natural numbers have metric Poissonian pair…

Number Theory · Mathematics 2023-08-21 Tanmoy Bera , Mithun Kumar Das , Anirban Mukhopadhyay

It is known that all resolution IV regular $2^{n-m}$ designs of run size $N=2^{n-m}$ where $5N/16<n<N/2$ must be projections of the maximal even design with $N/2$ factors and, therefore, are even designs. This paper derives a general and…

Statistics Theory · Mathematics 2009-09-04 Hegang H. Chen , Ching-Shui Cheng

Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…

Representation Theory · Mathematics 2023-05-25 Emily Barnard , Eric J. Hanson

The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the…

Cryptography and Security · Computer Science 2011-12-30 Jianqin Zhou , Jun Liu , Wanquan Liu

Seth (Mathematics Stack Exchange, http://math.stackexchange.com/q/1812699) posed a problem that is equivalent to the following: how many binary strings of length n have exactly k pairs of consecutive 0s and exactly m pairs of consecutive…

Combinatorics · Mathematics 2016-09-06 Jeremy M. Dover

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

A novel generalization of the Prouhet-Thue-Morse sequence to binary $\pm 1$-weight sequences is presented. Derived from Rademacher functions, these weight sequences are shown to satisfy interesting orthogonality and recurrence relations. In…

Number Theory · Mathematics 2014-05-28 Hieu D. Nguyen

Let X be an ordered alphabet. Lie_2(n) (and P_2(n) respectively) are the multilinear parts of the free Lie algebra (and the free Poisson algebra respectively) on X with a pair of compatible Lie brackets. In this paper, we prove the…

Combinatorics · Mathematics 2008-08-27 Fu Liu

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Number Theory · Mathematics 2020-05-19 Arne Winterhof , Zibi Xiao

The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered in this correspondence. By generalizing a result by…

Information Theory · Computer Science 2016-11-17 Kai-Uwe Schmidt