Related papers: Some Notes on Constructions of Binary Sequences wi…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Controlling peak side-lobe level (PSL) is of great importance in high-resolution applications of multiple-input multiple-output (MIMO) radars. In this paper, designing sequences with good autocorrelation properties are studied. The PSL of…
Whether explicit or implicit, sets are a critical part of many pieces of software. As a result, it is necessary to develop abstractions of sets for the purposes of abstract interpretation, model checking, and deductive verification.…
We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.
We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…
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…
This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…
The run vector of a binary sequence reflects the run structure of the sequence, which is given by the set of all substrings of the run length encoding. The run vector and the aperiodic autocorrelations of a binary sequence are strongly…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
We survey current developments in the approximation theory of sequence modelling in machine learning. Particular emphasis is placed on classifying existing results for various model architectures through the lens of classical approximation…
Recent results concerning the relation of topology and low-lying fermion modes are summarized.
A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums at each of the non-zero time-shifts within {a} certain region, called the zero correlation zone (ZCZ). ZCPs are categorised into two…
We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…
Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \emph{et al.}, "Optimal locally repairable codes and connections to…
We study how correlations in the design matrix influence Lasso prediction. First, we argue that the higher the correlations are, the smaller the optimal tuning parameter is. This implies in particular that the standard tuning parameters,…
I will argue why and how it is that precise measurements of the self-couplings of the weak vector bosons are a vista on the mechanism of symmetry breaking. Guided by what we have learnt from the present precision data, it is suggested which…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for…