Related papers: Experimental Constructions of Binary Matrices with…
In this paper we obtain several results concerning the optimization of higher Steklov eigenvalues both in two and higher dimensional cases. We first show that the normalized (by boundary length) $k$-th Steklov eigenvalue on the disk is not…
Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance plays a vital role in determining the error-correcting capability and the constructions of symbol-pair codes with…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
We present high resolution spectro-astrometry of a sample of 28 Herbig Ae/Be and 3 F-type pre-main sequence stars. The spectro-astrometry is shown from both empirical and simulated data to be capable of detecting binary companions that are…
In this paper, we design low correlation binary sequences favorable in wireless communication and radar applications. First, we formulate the designing problem as a nonconvex combination optimization problem with flexible correlation…
We associate a sequence of variational eigenvalues to any Radon measure on a compact Riemannian manifold. For particular choices of measures, we recover the Laplace, Steklov and other classical eigenvalue problems. In the first part of the…
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…
We call a family $\{Y_1,\dots,Y_I\}$ in Euclidean space an equidistance spacing if $\|y_i - y_j\| = 1$ whenever $y_i \in Y_i, y_j \in Y_j$ and $i \neq j$. In other words, choosing a representative from each set produces a complete distance…
We revisit the linear programming bounds for the size vs. distance trade-off for binary codes, focusing on the bounds for the almost-balanced case, when all pairwise distances are between $d$ and $n-d$, where $d$ is the code distance and…
We consider the optimal approximation of arbitrary qubit states with respect to an available states consisting the eigenstates of two of three Pauli matrices, the $B_2$-distance of an arbitrary target state. Both the analytical formulae of…
The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column distances maximize the column distances for a given…
We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any $n$-point doubling metric, any $\eps > 0$, and any integer $0 \le k \le n-2$, our construction provides a…
Nonconvex and nonsmooth bi-level optimization poses critical theoretical challenges, while arising in several applications. In this work, we develop a method for nonconvex, nonsmooth bi-level optimization and introduce Binno, a first-order…
A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…
Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…
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.
For many machine learning algorithms such as $k$-Nearest Neighbor ($k$-NN) classifiers and $ k $-means clustering, often their success heavily depends on the metric used to calculate distances between different data points. An effective…