Related papers: An Algebraic-Coding Equivalence to the Maximum Dis…
The necessary and sufficient conditions for a function to be totally or partially separable are derived. It is shown that a function is totally separable if and only if each component of the gradient vector of depends only on the…
We show that the statement ``In every separable pseudometric space there is a maximal non-strictly \delta-separated set.'' implies the axiom of choice for countable families of sets. This gives answers to a question of Dybowski and…
We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…
The ability to compute the exact divergence between two high-dimensional distributions is useful in many applications but doing so naively is intractable. Computing the alpha-beta divergence -- a family of divergences that includes the…
In this paper, a geometric condition on domains will be given which guarantees the boundary differentiability of solutions of elliptic equations, that is, the solutions are differentiable at any boundary point. We will show that this…
We propose an algebraic setup for end-to-end physical-layer network coding based on submodule transmission. We introduce a distance function between modules, describe how it relates to information loss and errors, and show how to compute…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which…
In a recent article S. Gharibian [\href{http://dx.doi.org/10.1103/PhysRevA.86.042106}{Phys. Rev. A {\bf 86}, 042106 (2012)}] has conjectured that no two qubit separable state of rank greater than two could be maximally non classical…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…
Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.
Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code. One of the central themes in…
Separability of multivariate functions alleviates the difficulty in finding a minimum or maximum value of a function such that an optimal solution can be searched by solving several disjoint problems with lower dimensionalities. In most of…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
We consider the separability of rank two quantum states on multiple quantum spaces with different dimensions. The sufficient and necessary conditions for separability of these multiparty quantum states are explicitly presented. A…
Rosenthal et al. introduced and thoroughly studied the notion of Maximum Distance Profile (MDP) convolutional codes over (non-binary) finite fields refining the classical notion of optimum distance profile, see for instance [18, p.164].…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…