Related papers: A General Construction of Binary Sequences with Op…
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of…
We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions…
Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.
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…
A sort of calculus is developed to find the chiral algebras of N=2 superconformal interacting bosonic models. Many examples are discussed. It is shown that the algebras share a common structure, which we call almost Landau Ginzburg. For one…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
We study the class of idempotent-generated pseudo-composition algebras, which is a subclass of the family of axial algebras. More specifically, we utilise the group-algebra correspondence, natural to the axial framework in order to study…
We review the new approach to the theory of nonlinear $W$-algebras which is developed recently and called {\it conformal linearization}. In this approach $W$-algebras are embedded as subalgebras into some {\it linear conformal} algebras…
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial $f(x)$. We study in detail the cycle structure of the set $\Omega(f(x))$ that…
Tang and Ding \cite{X. Tang} present a series of quaternary sequences $w(a, b)$ interleaved by two binary sequences $a$ and $b$ with ideal autocorrelation and show that such interleaved quaternary sequences have optimal autocorrelation. In…
A method for constructing sets of sequences with zero-correlation zone (ZCZ sequences) and sequence sets with low cross correlation is proposed. The method is to use families of short sequences and complete orthogonal sequence sets to…
We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.
The question of determining a signal from its higher-order autocorrelation data is of practical interest in fields as varied as X-ray crystallography, image processing, and satellite communications. At the heart of the issue is how much of…
(a) We propose a ``static'' construction procedure for random networks with given correlations of the degrees of the nearest-neighbor vertices. This is an equilibrium graph, maximally random under the constraint that its degree-degree…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
Elementary cellular automata deterministically map a binary sequence to another using simple local rules. Visualizing the structure of this mapping is difficult because the number of nodes (i.e. possible binary sequences) grows…
We consider the problem of testing whether a correlation matrix of a multivariate normal population is the identity matrix. We focus on sparse classes of alternatives where only a few entries are nonzero and, in fact, positive. We derive a…
In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…
In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…