相关论文: Cayley-Bacharach and evaluation codes on complete …
The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in quantum information processing. A subclass of attractive BCH codes is the…
The convex and metric structures underlying probabilistic physical theories are generally described in terms of base normed vector spaces. According to a recent proposal, the purely geometrical features of these spaces are appropriately…
Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellens\"atze, which certify…
These draft notes are from a graduate course given by the author in Berkeley during the spring semester of 2005. They cover the basic ideas of a new, geometric approach to geometric measure theory. They begin with a new theory of exterior…
This paper has three main goals : (1) To give an axiomatic formulation of the construction of "reduced \v{C}ech complexes", complexes using fewer than the usual number of intersections but still computing cohomology of an appropriate class…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…
We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root…
We study the interplay between geometry and partial differential equations. We show how the fundamental ideas we use require the ability to correctly calculate the dimensions of spaces associated to the varieties of zeros of the symbols of…
We analyse Hamiltonian-type systems of second-order elliptic PDE invariant under a non-compact group and, consequently, involve a lack of compactness of the Sobolev embedding. We show that the loss of compactness can be compensated by using…
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
In previous works, we have introduced the blown-up intersection cohomology and used it to extend Sullivan's minimal models theory to the framework of pseudomanifolds, and to give a positive answer to a conjecture of M. Goresky and W. Pardon…
Plateau's problem is to find a surface with minimal area spanning a given boundary. In 1960, Reifenberg and Adams developed a definition for "span" using \v{C}ech homology, and variants of this definition have been used ever sense. However,…
We prove a $p$-adic version of the Integral Geometry Formula for averaging the intersection of two $p$-adic projective algebraic sets. We apply this result to give bounds on the number of points in the modulo $p^m$ reduction of a projective…
We study the arithmetical ranks and the cohomological dimensions of an infinite class of Cohen-Macaulay varieties of minimal degree. Among these we find, on the one hand, infinitely many set-theoretic complete intersections, on the other…
We consider the minimum distance projection in the $L_2$-norm from an arbitrary point in an $n$-dimensional, Euclidian space onto the canonical simplex. It is shown that this problem reduces to a univariate problem that can be solved by a…
Motivated by applications to noncoherent network coding, we study subspace codes defined by sets of linear cellular automata (CA). As a first remark, we show that a family of linear CA where the local rules have the same diameter -- and…
This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…