Related papers: The minimum distance of parameterized codes on pro…
Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals…
In this paper we consider metrics determined by hierarchical posets and give explicit formulae for the main parameters of a linear code: the minimum distance and the packing, covering and Chebyshev radii of a code. We also present ten…
The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
The distant graph $G = G(\mathbb{P}(Z),\triangle)$ of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein's geometric interpretation of Euclidean continued…
We construct families of locally recoverable codes with availability $t\geq 2$ using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper…
Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with…
Let $\mathcal{Z(R)}$ be the set of zero divisor elements of a commutative ring $R$ with identity and $\mathcal{M}$ be the space of minimal prime ideals of $R$ with Zariski topology. An ideal $I$ of $R$ is called strongly dense ideal or…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
In a space-time, a conformal structure is defined by the distribution of light-cones. Geodesics are traced by freely falling particles, and the collection of all unparameterized geodesics determines the projective structure of the…
Consider a compact $M \subset \mathbb{R}^d$ and $r > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the minimal length, such that \[ \max_{y \in M} dist (y, \Sigma) \leq r. \] The inverse problem is…
An ideal is a nonempty collection of subsets closed under heredity and finite additivity. The aim of this paper is to unify some weak separation properties via topological ideals. We concentrate our attention on the separation axioms…
Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \emph{et al.}, "Optimal locally repairable codes and connections to…
In recent work, J. Hansen uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in the projective plane. In this paper, we generalize Hansen's results…
Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…
In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \leq 1$ and there are at most $k$…
In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum…