Related papers: Minimum weight codewords in dual Algebraic-Geometr…
The $p$-ary linear code $\mathcal C_{k}(n,q)$ is defined as the row space of the incidence matrix $A$ of $k$-spaces and points of $\text{PG}(n,q)$. It is known that if $q$ is square, a codeword of weight $q^k\sqrt{q}+\mathcal O \left(…
In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all $\mathbb F_{q^2}$-rational points of the curve is determined; the Feng-Rao designed minimum distance is…
We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.
We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…
Pre-transformed polar codes (PTPCs) form a class of codes that perform close to the finite-length capacity bounds. The minimum distance and the number of minimum weight codewords are two decisive properties for their performance. In this…
We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…
In this paper, we study the p-ary linear code C(PG(n, q)), q = p^h, p prime, h >= 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small…
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…
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…
The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame…
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne--Lusztig surfaces. The methods based on an intensive use of the intersection…
We establish the existence of optimal maximal entanglement entanglement-assisted quantum $[[n,k,d;n-k]]_2$ codes for $(n,k,d)=(14,6,7)$, $(15,7,7)$, $(17,6,9)$, $(17,7,8)$, $(19,7,9)$ and $(20,7,10)$. These codes are obtained from…
Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…
We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassmann codes associated to the $2$-Grassmannian of a Hermitian polar space defined over a finite field of square order. In particular, we…
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…
Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert--Varshamov lower bound on the…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…