相关论文: On the small weight codewords of the functional co…
Over the past few years, the codes $\mathcal{C}_{n-1}(n,q)$ arising from the incidence of points and hyperplanes in the projective space $\text{PG}(n,q)$ attracted a lot of attention. In particular, small weight codewords of…
Let $C_{n-1}(n,q)$ be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG($n,q$). Recently, Polverino and Zullo proved that within this code, all non-zero code words of weight at most…
In [9], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the…
We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…
In this paper, we study the codes $\mathcal C_k(n,q)$ arising from the incidence of points and $k$-spaces in $\text{PG}(n,q)$ over the field $\mathbb F_p$, with $q = p^h$, $p$ prime. We classify all codewords of minimum weight of the dual…
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(…
We investigate small weight code words of the $p$-ary linear code $\mathcal C_{j,k}(n,q)$ generated by the incidence matrix of $k$-spaces and $j$-spaces of PG$(n,q)$ and its dual, with $q$ a prime power and $0 \leq j < k < n$. Firstly, we…
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…
We study the functional codes $C_2(X)$ defined on a projective variety $X$, in the case where $X \subset {\mathbb{P}}^3$ is a non-degenerate hermitian surface. We first give some bounds for $# X_{Z(\mathcal{Q})}(\mathbb{F}_{q})$, which are…
Let Ck(n, q) be the p-ary linear code defined by the incidence matrix of points and k-spaces in PG(n, q), q = p^h, p prime, h >= 1. In this pa- per, we show that there are no codewords of weight in the open interval ] q^{k+1}-1/q-1, 2q^k[…
A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…
Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…
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 completely characterize the words with second minimum weight in the $p-$ary linear code generated by the rows of the incidence matrix of points and hyperplanes of $PG(n,q)$, with $q=p^h$ and $p$ prime, proving that they are…
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…
We characterise the minimum weight codewords of the $p$-ary linear code of intersecting lines in ${\rm PG}(3,q)$, $q=p^h$, $q\geq19$, $p$ prime, $h\geq 1$. If $q$ is even, the minimum weight equals $q^3+q^2+q+1$. If $q$ is odd, the minimum…
In this paper, we study the p-ary linear code Ck(n, q), q = ph, p prime, h >= 1, generated by the incidence matrix of points and k-dimensional spaces in PG(n, q). For k >= n/2, we link codewords of Ck(n, q)\Ck(n, q) of weight smaller than…
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…
We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…
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…