Related papers: Toric complete intersection codes
We apply ideas from intersection theory on toric varieties to tropical intersection theory. We introduce mixed Minkowski weights on toric varieties which interpolate between equivariant and ordinary Chow cohomology classes on complete toric…
We prove a Horrocks-type splitting criterion for arbitrary smooth projective toric varieties under an additional hypothesis similar to the case of products of projective spaces by Eisenbud--Erman--Schreyer.
Binary codes are constructed from incidence matrices of hypergraphs. A combinatroial description is given for the minimum distances of such codes via a combinatorial tool called ``eonv". This combinatorial approach provides a faster…
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.
We discuss the need to compare total cross-section measurements at LHC and HERA with each other and with available models in order to obtain a more precise prediction of the total hadronic cross-section at the future Linear Collider, thus…
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…
We study points of moderately low degree on a curve $C$ over a number field, which is embedded on a nice toric surface $S$. Recently, Smith and Vogt related the linear equivalence classes of such points to intersections of $C$ with curves…
Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.
We define an extension of the toric (middle perversity intersection homology) $g$-vector of a convex polytope $X$. The extended $g(X)$ encodes the whole of the flag vector $f(X)$ of $X$, and so is called complete. We find that for many…
Let $X$ be a complete simplicial toric variety over a finite field with a split torus $T_X$. For any matrix $Q$, we are interested in the subgroup $Y_Q$ of $T_X$ parameterized by the columns of $Q$. We give an algorithm for obtaining a…
We develop an approach to study the irreducibility of generic complete intersections in the algebraic torus defined by equations with fixed monomials and fixed linear relations on coefficients. Using our approach we generalize the…
We determine the number of singularities - counted whit multiplicities - of generic distributions of dimension and codimension one on smooth complete intersections in compact toric orbifolds with isolated singularities. We also present some…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
We extend the methods developed in our earlier work to algorithmically compute the intersection cohomology Betti numbers of reductive varieties. These form a class of highly symmetric varieties that includes equivariant compactifications of…
We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions. Recent qubit work [PRX Quantum 6, 020357 (2025)] showed that,…
We combine the split torsor method and the hyperbola method for toric varieties to count rational points and Campana points of bounded height on certain subvarieties of toric varieties.
We give local conditions at the infinite places of a number field K ensuring that the intersection of n quadrics in projective N-space over K, N >> n, satisfies weak approximation.
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
In this paper we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes through the notion of $\mathbb{B}$-apparent distance. We use…