相关论文: Toric surface codes and Minkowski sums

We study subfield-subcodes of Generalized Toric (GT) codes over $\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We identify polynomial…

Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for…

We generalized the construction of deformations of affine toric varieties of K. Altmann and our previous construction of deformations of weak Fano toric varieties to the case of arbitrary toric varieties by introducing the notion of…

In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…

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…

Toric varieties and their associated toric codes, as well as determination of their parameters with intersection theory, are presented in the two dimensional case. Linear Secret Sharing Schemes with strong multiplication are constructed…

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…

Subspace codes, especially cyclic constant subspace codes, are of great use in random network coding. Subspace codes can be constructed by subspaces and subspace polynomials. In particular, many researchers are keen to find special…

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

We define a statistical measure of the typical size of short words in a linear code over a finite field. We prove that the dual toric codes coming from polytopes of degree one are characterized, among all dual toric codes, by being extremal…

We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on $N$ qubits with logarithmic weight stabilizers and distance $N^{1-\epsilon}$ for any…

Analogs of Reed-Solomon codes are introduced within the framework of bottleneck poset metrics. These codes are proven to be maximum distance separable. Furthermore, the results are extended to the setting of Algebraic Geometry codes.

A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…

We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…

Consider an n-dimensional projective toric variety X defined by a convex lattice polytope P. David Cox introduced the toric residue map given by a collection of n+1 divisors Z_0,...,Z_n on X. In the case when the Z_i are T-invariant…

Consider a set of $r$ convex $d$-polytopes $P_1,P_2,...,P_r$, where $d\ge{}3$ and $r\ge{}2$, and let $n_i$ be the number of vertices of $P_i$, $1\le{}i\le{}r$. It has been shown by Fukuda and Weibel that the number of $k$-faces of the…

PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…

To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…

Extending work of M. Zarzar, we evaluate the potential of Goppa-type evaluation codes constructed from linear systems on projective algebraic surfaces with small Picard number. Putting this condition on the Picard number provides some…

We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…