Related papers: Coherence Optimization and Best Complex Antipodal …
We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equidimensional vector…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
We introduce a new family of codes, termed weighted superimposed codes (WSCs). This family generalizes the class of Euclidean superimposed codes (ESCs), used in multiuser identification systems. WSCs allow for discriminating all bounded,…
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
An important problem that arises in many engineering applications is the boundary value problem for ordinary differential equations. There have been many computational methods proposed for dealing with this problem. The convergence of the…
Given a set of vectors $\F=\{f_1,\dots,f_m\}$ in a Hilbert space $\HH$, and given a family $\CC$ of closed subspaces of $\HH$, the {\it subspace clustering problem} consists in finding a union of subspaces in $\CC$ that best approximates…
An equiangular tight frame (ETF) is a sequence of vectors in a Hilbert space that achieves equality in the Welch bound and so has minimal coherence. More generally, an equichordal tight fusion frame (ECTFF) is a sequence of equi-dimensional…
In order to study real-world systems, many applied works model them through signed graphs, i.e. graphs whose edges are labeled as either positive or negative. Such a graph is considered as structurally balanced when it can be partitioned…
Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere…
The index coding problem is studied from an interference alignment perspective, providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between multiple unicast…
Gaussian mixture model is very useful in many practical problems. Nevertheless, it cannot be directly generalized to non Euclidean spaces. To overcome this problem we present a spherical Gaussian-based clustering approach for partitioning…
Bin Packing with Conflicts (BPC) are problems in which items with compatibility constraints must be packed in the least number of bins, not exceeding the capacity of the bins and ensuring that non-conflicting items are packed in each bin.…
This paper considers vector network coding solutions based on rank-metric codes and subspace codes. The main result of this paper is that vector solutions can significantly reduce the required alphabet size compared to the optimal scalar…
Automated chemical synthesis, materials fabrication, and spectroscopic physical measurements often bring forth the challenge of process trajectory optimization, i.e., discovering the time dependence of temperature, electric field, or…
This paper deals with vector linear index codes for multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the receiver…
An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…
As an analogy of best separable approximation (BSA) in the framework of entanglement theory, here we concentrate on the notion of best incoherent approximation, with application to characterizing and quantifying quantum coherence. From both…