Related papers: Cayley-Bacharach and evaluation codes on complete …
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a…
The puncturing and shortening technique are two important approaches to constructing new linear codes from old ones. In the past 70 years, a lot of progress on the puncturing technique has been made, and many works on punctured linear codes…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…
Experimental limits on supersymmetry and similar theories are difficult to set because of the enormous available parameter space and difficult to generalize because of the complexity of single points. Therefore, more phenomenological,…
Despite the theoretical and practical significance of BCH codes, the exact minimum distance and dimension remain unknown for many families. This paper establishes the precise minimum distance and dimension of narrow-sense BCH codes $\C_{(q,…
We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for…
M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…
We consider the problem of estimating the orientation of a 3D object with the assistance of configurable backscatter tags. We explore the idea of designing tag response codes to improve the accuracy of orientation estimation. To minimize…
Bounds on the exchange-correlation energy of many-electron systems are derived and tested. By using universal scaling properties of the electron-electron interaction, we obtain the exponent of the bounds in three, two, one, and quasi-one…
We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse…
Using Saito's theory of mixed Hodge modules, we study a generalization of Hellus-Schenzel's "cohomologically complete intersection" property. This property is equivalent to perversity of the shifted constant sheaf. We relate the generalized…
Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by investigating geometric percolation of non-interacting line segments and disks in two spatial dimensions. These examples serve as models for…
We introduce the concept of an obstacle skeleton which is a set of line segments inside a polygonal obstacle $\omega$ that can be used in place of $\omega$ when performing intersection tests for obstacle-avoiding network problems in the…
We find a priori and a posteriori error estimates of the best proximity point for the Picard iteration associated to a cyclic contraction map, which is defined on a uniformly convex Banach space with modulus of convexity of power type. We…
The Carleman linearization is one of the mainstream approaches to lift a finite-dimensional nonlinear dynamical system into an infinite-dimensional linear system with the promise of providing accurate approximations of the original…
In this paper, we study the minimum distances of binary linear codes with parity check matrices formed from subset inclusion matrices $W_{t,n,k}$, representing $t$-element subsets versus $k$-element subsets of an $n$-element set. We provide…
As a crucial approach for compact representation learning, hashing has achieved great success in effectiveness and efficiency. Numerous heuristic Hamming space metric learning objectives are designed to obtain high-quality hash codes.…