English
Related papers

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

200 papers

Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…

Information Theory · Computer Science 2009-09-01 Dragomir Z. Djokovic

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

We establish new conditions under which a sequence of real numbers has metric Poissonian pair correlation. These conditions strengthen results of Aistleitner, El-Baz and Munsch (2021) and resolve one of their open problems under a mild…

Number Theory · Mathematics 2025-08-15 Bryce Kerr , Hongliang Wang

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…

Number Theory · Mathematics 2013-06-20 Yotam Smilansky

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

A new method to construct $q$-ary complementary sequence sets (CSSs) and complete complementary codes (CCCs) of size $N$ is proposed by using desired para-unitary (PU) matrices. The concept of seed PU matrices is introduced and a systematic…

Information Theory · Computer Science 2020-01-15 Zilong Wang , Dongxu Ma , Guang Gong , Erzhong Xue

Using a $U$-duality symmetry of type II compactification on $T^4$ represented by triality action on the $T$-duality group, and applying the adiabatic argument we construct dual pairs of type II compactifications in lower dimensions. The…

High Energy Physics - Theory · Physics 2009-09-15 Ashoke Sen , Cumrun Vafa

We give a short and elementary proof of the fact that for a linear complementary pair $(C,D)$, where $C$ and $D$ are $2$-sided ideals in a group algebra, $D$ is uniquely determined by $C$ and the dual code $D^\perp$ is permutation…

Information Theory · Computer Science 2019-07-18 Martino Borello , Javier de la Cruz , Wolfgang Willems

Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…

Information Theory · Computer Science 2026-02-03 Qin Yuan , Chunlei Li , Xiangyong Zeng

We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given size has exactly one occurrence, we partition the positions in…

Information Theory · Computer Science 2023-01-03 Verónica Becher , Olivier Carton

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 extend the paraunitary (PU) theory for complementary pairs to comple- mentary sets and complete complementary codes (CCC) by proposing a new PU construction. A special, but very important case of complementary sets (and CC- C), based on…

Information Theory · Computer Science 2018-08-31 Srdjan Z. Budisin

Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are…

Number Theory · Mathematics 2020-12-01 A. de Clercq , F. Luca , L. Martirosyan , M. Matthis , P. Moree , M. A. Stoumen , M. Weiß

A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is…

Information Theory · Computer Science 2018-02-14 Kazuyoshi Tsuchiya , Yasuyuki Nogami , Satoshi Uehara

In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…

Combinatorics · Mathematics 2019-01-03 James Mc Laughlin , Nancy J. Wyshinski

Given a positive, non-increasing sequence $a$ with finite sum equal to $1$, we consider the family of all closed subsets of $[0,1]$ whose complementary open intervals have lengths given by a rearrangement of the sequence $a$. We study the…

Classical Analysis and ODEs · Mathematics 2025-11-18 Nicolas Angelini , Ursula Molter

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

Number Theory · Mathematics 2018-02-15 Claude Levesque , Michel Waldschmidt

We demonstrate that discrete m-functions with eventually periodic continued fraction coefficients have an algebraic relationship to their second solution if and only if the periodic part of the sequence of continued fraction coefficients is…

Number Theory · Mathematics 2022-05-16 Hunter Handley , Brian Simanek

In this paper we prove that an abelian group contains $(2^{2m+1}(2^{m-1}+1), 2^m(2^m+1), 2^m)$-difference sets with $m\geqslant 3$ if and only if it contains an elementary abelian 2-group of order $2^{2m}$. Our proof shows that the method…

Combinatorics · Mathematics 2007-05-23 K. T. Arasu , Yu Qing Chen , Alexander Pott

A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…

Combinatorics · Mathematics 2015-03-16 Toufik Mansour , Mark Shattuck