Related papers: Codes from surfaces with small Picard number

We determine the number of cusps of minimal Picard modular surfaces. The proof also counts cusps of other Picard modular surfaces of arithmetic interest. Consequently, for each N > 0 there are finitely many commensurability classes of…

Let $X\subset \mathbb P^r$ be a projective factorial variety of dimension $3$, degree $n$, with at worst isolated singularities. Assume that the Picard group of $X$ is generated by the hyperplane section class. Let $C\subset X$ be a…

In this paper we treat several topics regarding numerical Weierstrass semigroups and the theory of Algebraic Geometric Codes associated to a pair $(X, P)$, where $X$ is a projective curve defined over the algebraic closure of the finite…

In this note we improve a result of Steffens on the lower bound for Seshadri constants in very general points of a surface with one-dimensional N\'eron-Severi space. We also show a multi-point counterpart of such a lower bound.

We construct Locally Recoverable Codes (LRCs) with availability $2$ from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from…

We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

Let $X$ be an irreducible smooth geometrically integral projective surface over a field. In this paper we give an effective bound in terms of the Neron--Severi rank $\rho(X)$ of $X$ for the number of irreducible curves $C$ on $X$ with…

There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…

Classification of curves in a projective space occupies minds of many mathematicians. First step in doing so is classification of curves on a given surface. This brings us to consideration of the nonsingular Del Pezzo Surface in $P^4_k.$ We…

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…

The separation dimension of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before…

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…

Let $p$ be a prime number and $s> 0$ an integer. In this short note, we investigate one-point geometric Goppa codes associated with an elementary abelian $p$-extension of $\mathbb{F}_{p^{s}}(x)$. We determine their dimension and the exact…

This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured.…

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus,…

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…