Related papers: The minimum distance of parameterized codes on pro…
Given a 0-dimensional affine K-algebra R=K[x_1,...,x_n]/I, where I is an ideal in a polynomial ring K[x_1,...,x_n] over a field K, or, equivalently, given a 0-dimensional affine scheme, we construct effective algorithms for checking whether…
We study the tradeoffs between the locality and parameters of subsystem codes. We prove lower bounds on both the number and lengths of interactions in any $D$-dimensional embedding of a subsystem code. Specifically, we show that any…
In the pattern formation problem, robots in a system must self-coordinate to form a given pattern, regardless of translation, rotation, uniform-scaling, and/or reflection. In other words, a valid final configuration of the system is a…
We devise an analytically simple as well as invertible approximate expression, which describes the relation between the minimum distance of a binary code and the corresponding maximum attainable code-rate. For example, for a rate-(1/4),…
In this paper, we introduce a new parameter of a code, referred to as the remoteness, which can be viewed as a dual to the covering radius. Indeed, the remoteness is the minimum radius needed for a single ball to cover all codewords. After…
In an earlier paper we conjectured a relation between the quantum $\mathcal D$-modules of a smooth variety $X$ and the projectivisation of a direct sum of line bundles over it. In this paper we prove the conjecture when $X$ is a complete…
In this paper we make a first attempt at understanding how to build an optimal approximate normal factor analysis model. The criterion we have chosen to evaluate the distance between different models is the I-divergence between the…
A paper torus is a piecewise linear isometric embedding of a flat torus into $\R^3$. Following up on the $8$-vertex paper tori discovered by the second author, we prove universality and collapsibility results about these objects. One…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
In this paper we study the problem of maximizing the distance to a given point $C_0$ over a polytope $\mathcal{P}$. Assuming that the polytope is circumscribed by a known ball we construct an intersection of balls which preserves the…
Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and…
We consider the distance minimization problem to a real algebraic variety $X \subseteq \RR^n$ when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the…
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to…
We study linear codes that maximize minimum distance subject to arbitrary support constraints on the parity-check matrix. Such constraints arise naturally in the design of LDPC codes, locally repairable codes, and hardware-constrained…
Let $(X, A)$ be a polarized nonsingular toric 3-fold with not effective $A+K_X$. Then for any ample line bundle $L$ on $X$ the image of the embedding by the complete linear system of $L$ is an intersections of quadrics.
Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of…
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…
In this article we review known results on parameterized linear codes over graphs, introduced by Renter\'ia, Simis and Villarreal in 2011. Very little is known about their basic parameters and invariants. We review in detail the parameters…
Let $I$ be a square-free monomial ideal $I$ of projective dimension one. Starting with the Taylor complex on the generators of $I^r$, we use Discrete Morse theory to describe a CW complex that supports a minimal free resolution of $I^r$. To…
Let $k$ be a perfect field, and $X$ an irreducible smooth projective curve over $k$. We give a criterion for a vector bundle over $X$ to admit a logarithmic connection singular over a finite subset of $X$ with given residues, where residues…