Related papers: Toric Codes and Finite Geometries
For any affine-variety code we show how to construct an ideal whose solutions correspond to codewords with any assigned weight. We classify completely the intersections of the Hermitian curve with lines and parabolas (in the…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
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…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research…
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…
We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric.…
In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the…
Borrowing ideas from elliptic complex geometry, we approach M-theory compactifications on real toric fibrations. Precisely, we explore real toric equations rather than complex ones exploited in F-theory and related dual models. These…
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,…
In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…
Toric codes are a type of evaluation code introduced by J.P. Hansen in 2000. They are produced by evaluating (a vector space composed by) polynomials at the points of $(\mathbb{F}_q^*)^s$, the monomials of these polynomials being related to…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…
We develop the basic theory of geometrically closed rings as a generalisation of algebraically closed fields, on the grounds of notions coming from positive model theory and affine algebraic geometry. For this purpose we consider several…
From a rational convex polytope of dimension $r\ge 2$ J.P. Hansen constructed an error correcting code of length $n=(q-1)^r$ over the finite field $\fq$. A rational convex polytope is the same datum as a normal toric variety and a Cartier…
We develop a framework to construct geometric representations of finite groups $G$ through the correspondence between real toric spaces $X^{\mathbb R}$ and simplicial complexes with characteristic matrices. We give a combinatorial…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…