Related papers: The minimum distance of parameterized codes on pro…
Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose polygons with minimum…
A flat torus is the quotient of the Euclidean plane over a lattice generated by a basis, and an axis-aligned rectangular tiling of a flat torus is a partition into finitely many rectangles whose sides are axis-aligned. We provide the…
According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
Let $\K$ be a finite field and $X$ be a complete simplicial toric variety over $\K$. We give an algorithm relying on elimination theory for finding generators of the vanishing ideal of a subgroup $Y_Q$ parameterized by a matrix $Q$ which…
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…
We improve the best known lower bound for the dimension of radial projections of sets in the plane. We show that if $X,Y$ are Borel sets in $\R^2$, $X$ is not contained in any line and $\dim_H(X)>0$, then $$\sup\limits_{x\in X} \dim_H(\pi_x…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
We consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite field $K=\mathbb{F}_q$ and the finite set of projective rational points $\mathbb{X}$ that it defines in the projective space…
We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…
This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. The main results show that in some cases, over…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that…
Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also…
Let $\mathscr{A}$ be a finite set of closed rational points in projective space, let $\mathscr{I}$ be the vanishing ideal of $\mathscr{A}$, and let $\mathscr{D}(\mathscr{A})$ be the set of exponents of those monomials which do not occur as…
Let $R$ be a polynomial ring over a field in an unspecified number of variables. We prove that if $J \subset R$ is an ideal generated by three cubic forms, and the unmixed part of $J$ contains a quadric, then the projective dimension of…
We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal caps, we derive nonexistence theorems for LCD codes with minimum distance at…