SearcharxivSearch

arXiv subjects

Stefano Marcugini

Publications and source records attributed to Stefano Marcugini.

At least 19 recordsLinked to original sources

Weight distributions of cosets of weight 2 of the generalized doubly extended Reed-Solomon codes

We consider the weight distributions of the cosets of weight 2 of the generalized $[q+1,q+2-d,d]_q$ doubly extended Reed-Solomon codes (GDRS) of minimum distance $d\ge5$, over the finite field $\mathbb{F}_q$ with $q$ elements. For a GDRS code, we say that Case S occurs if the weight distribution for all cosets of weight 2 is the same or otherwise, Case NS occurs. For Case S, the weight distribution is known; however, any sufficient condition for the occurrence of Case S remained an open problem. We prove that if $q-1$ and $d-2$ are coprime then Case S holds, i.e. the problem is solved. Furthermore, we note that in Case S, the GDRS code is 2-regular. Also, we introduce two new open equivalent combinatorial problems for finite fields $\mathbb{F}_q$ (Problem $A_{q,\mu}^\times$) and for rings $\mathbb{Z}_\mathfrak{R}$ of integers modulo $\mathfrak{R}$ (Problem $A_{\mathfrak{R},\mu}^+$), where $\mu$ is a parameter. In particular, Problem $A_{\mathfrak{R},\mu}^+$ is as follows: for each element $\lambda$ of $\mathbb{Z}_\mathfrak{R}$, determine the number of all possible $\mu$-tuples $\{\lambda_1,\lambda_2,\ldots,\lambda_{\mu}\}$, each of which consists of $\mu$ distinct elements $\lambda_j$ of $\mathbb{Z}_\mathfrak{R}$ such that their sum in $\mathbb{Z}_\mathfrak{R}$ is equal to $\lambda$. Open Problems $A_{q,\mu}^\times$ and $A_{\mathfrak{R},\mu}^+$ are interesting in their own right and, moreover, we proved that their solutions allow us to obtain the weight distributions for Case NS, taking $\mu=d-2$ and $\mathfrak{R}=q-1$. To solve Problem $A_{\mathfrak{R},\mu}^+$, we found a universal method, connected with the values of $\mathfrak{R}$ and $\mu$, using orbits of elements in $\mathbb{Z}_\mathfrak{R}$ and then we solved the problem for many pairs $\mathfrak{R},\mu$, obtaining the needed weight distributions for the corresponding pairs $q=\mathfrak{R}+1,d=\mu+2$.

cs.IT

Orbits and incidence matrices for points, planes and lines regarding the twisted cubic in PG(3,q), q = 2, 3, 4

In the three-dimensional projective space PG(3,q) over the finite field F_q with q elements, we consider the normal rational curve known as a twisted cubic and the projectivity group G_q that fixes it. For q = 2, 3, 4, we solve the open problems of classifying the orbits of points, planes, and lines under G_q and of determining the corresponding incidence matrices between points, planes, and lines partitioned into these orbits.

math.CO

New upper bounds for binary linear covering codes

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$ compared to the best previously known upper bounds: \begin{equation*} R=2,\,r=2t,\,r=18,20,\text{ and }r\ge28,\,\ell_2(r,2)\le26\cdot2^{r/2-4}-1;\,\Delta(r,2)=2^{r/2-4}. \end{equation*} \begin{equation*} R=3,\,r=3t-1,\,r=26\text{ and }r\ge44,\,\ell_2(r,3)\le819\cdot2^{(r-26)/3}-1;\,\Delta(r,3)=2^{(r-23)/3}. \end{equation*} \begin{equation*} R=4,\,r=4t,\,r=40\text{ and }r\ge68,\,\ell_2(r,4)\le2943\cdot2^{r/4-10}-1;\,\Delta(r,4)=2^{r/4-10}-1. \end{equation*} To obtain these bounds we construct new infinite code families, using distinct versions of the $q^m$-concatenating constructions of covering codes; some of these versions are proposed in this paper. We also introduce new useful partitions of column sets of parity check matrices of some codes. The asymptotic covering densities $\overline{\mu}(2)\thickapprox1.3203$, $\overline{\mu}(3)\thickapprox1.3643$, $\overline{\mu}(4)\thickapprox2.8428$, provided by the codes of the new families, are smaller than the known ones.

math.CO

New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code

We present five new infinite families of linear near-MDS codes uniformly packed in the wide sense (UPWS). These codes are also almost perfect multiple coverings of the deep holes or farthest-off points (APMCF), i.e.\ the vectors lying at distance $R$ (covering radius) from the code. The families are constructed by $m$-lifting when one takes a starting code $C$ over the ground Galois field $\F_q$ with a parity check matrix $H(C)$ and then considers the codes $C_m$ over $F_{q^m}$, $m\ge2$, with the same parity check matrix $H(C)$. As starting codes we used the ternary perfect Golay code and codes obtained by its extension and puncturing. To prove the needed combinatorial properties (UPWS and APMCF), we used the $m$-lifting of the dual codes and features of near-MDS codes. A general theorem on infinite families of UPWS near-MDS codes is proved.

math.CO

Further results on orbits and incidence matrices for the class $\mathcal{O}_6$ of lines external to the twisted cubic in $\mathrm{PG}(3,q)$

In the literature, lines of the projective space $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits under the stabilizer group of the twisted cubic. The least studied class is named $\mathcal{O}_6$. This class contains lines external to the twisted cubic which are not its chords or axes and do not lie in any of its osculating planes. For even and odd $q$, we propose a new family of orbits of $\mathcal{O}_6$ and investigate in detail their stabilizer groups and the corresponding submatrices of the point-line and plane-line incidence matrices. To obtain these submatrices, we explored the number of solutions of cubic and quartic equations connected with intersections of lines (including the tangents to the twisted cubic), points, and planes in $\mathrm{PG}(3,q)$.

math.CO

An asymptotic property of quaternary additive codes

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $λ_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that $n_k(s)/s=λ_k.$ Our new family of quaternary additive codes has parameters $[4^k-1,k,4^k-4^{k-1}]_4=[2^{2k}-1,k,3\cdot 2^{2k-2}]_4$ (where $k=l/2$ and $l$ is an odd integer). These are constant-weight codes. The binary codes obtained by concatenation meet the Griesmer bound with equality. The proof is in terms of multisets of lines in $PG(l-1,2).$

math.CO

Further results on covering codes with radius R and codimension tR + 1

The length function $\ell_q(r,R)$ is the smallest possible length $n$ of a $ q $-ary linear $[n,n-r]_qR$ code with codimension (redundancy) $r$ and covering radius $R$. Let $s_q(N,\rho)$ be the smallest size of a $\rho$-saturating set in the projective space $\mathrm{PG}(N,q)$. There is a one-to-one correspondence between $[n,n-r]_qR$ codes and $(R-1)$-saturating $n$-sets in $\mathrm{PG}(r-1,q)$ that implies $\ell_q(r,R)=s_q(r-1,R-1)$. In this work, for $R\ge3$, new asymptotic upper bounds on $\ell_q(tR+1,R)$ are obtained in the following form: $\hspace{0.7cm} \bullet~\ell_q(tR+1,R) =s_q(tR,R-1)\le \sqrt[R]{\frac{R!}{R^{R-2}}}\cdot q^{(r-R)/R}\cdot\sqrt[R]{\ln q}+o(q^{(r-R)/R}), \hspace{0.3cm}r=tR+1,~t\ge1,~ q\text{ is an arbitrary prime power},~q\text{ is large enough};$ $\hspace{0.7cm} \bullet~\text{ if additionally }R\text{ is large enough, then }\sqrt[R]{\frac{R!}{R^{R-2}}}\thicksim\frac{1}{e}\thickapprox0.3679. $ The new bounds are essentially better than the known ones. For $t=1$, a new construction of $(R-1)$-saturating sets in the projective space $\mathrm{PG}(R,q)$, providing sets of small sizes, is proposed. The $[n,n-(R+1)]_qR$ codes, obtained by the construction, have minimum distance $R + 1$, i.e. they are almost MDS (AMDS) codes. These codes are taken as the starting ones in the lift-constructions (so-called "$q^m$-concatenating constructions") for covering codes to obtain infinite families of codes with growing codimension $r=tR+1$, $t\ge1$.

math.CO

New bounds for covering codes of radius 3 and codimension 3t+1

The smallest possible length of a $q$-ary linear code of covering radius $R$ and codimension (redundancy) $r$ is called the length function and is denoted by $\ell_q(r,R)$. In this work, for $q$ \emph{an arbitrary prime power}, we obtain the following new constructive upper bounds on $\ell_q(3t+1,3)$: $\ell_q(r,3)\lessapprox \sqrt[3]{k}\cdot q^{(r-3)/3}\cdot\sqrt[3]{\ln q},~r=3t+1, ~t\ge1, ~ q\ge\lceil\mathcal{W}(k)\rceil, 18 <k\le20.339,~\mathcal{W}(k)\text{ is a decreasing function of }k ;$ $\ell_q(r,3)\lessapprox \sqrt[3]{18}\cdot q^{(r-3)/3}\cdot\sqrt[3]{\ln q},~r=3t+1,~t\ge1,~ q\text{ large enough}.$ For $t = 1$, we use a one-to-one correspondence between codes of covering radius 3 and codimension 4, and 2-saturating sets in the projective space $\mathrm{PG}(3,q)$. A new construction providing sets of small size is proposed. The codes, obtained by geometrical methods, are taken as the starting ones in the lift-constructions (so-called ``$q^m$-concatenating constructions'') to obtain infinite families of codes with radius 3 and growing codimension $r = 3t + 1$, $t\ge1$. The new bounds are essentially better than the known ones.

math.CO

Incidence matrices for the class $\mathcal{O}_6$ of lines external to the twisted cubic in $\mathrm{PG}(3,q)$

We consider the structures of the plane-line and point-line incidence matrices of the projective space $\mathrm{PG}(3,q)$ connected with orbits of planes, points, and lines under the stabilizer group of the twisted cubic. In the literature, lines are partitioned into classes, each of which is a union of line orbits. In this paper, for all $q$, even and odd, we determine the incidence matrices connected with a family of orbits of the class named $\mathcal{O}_6$. This class contains lines external to the twisted cubic. The considered family include an essential part of all $\mathcal{O}_6$ orbits, whose complete classification is an open problem.

math.CO

Orbits of the class $\mathcal{O}_6$ of lines external with respect to the twisted cubic in $\mathrm{PG}(3,q)$

In the projective space $\mathrm{PG}(3,q)$, we consider orbits of lines under the stabilizer group of the twisted cubic. In the literature, lines of $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits. We propose an approach to obtain orbits of the class named $\mathcal{O}_6$, whose complete classification is an open problem. For all even and odd $q$ we describe a family of orbits of $\mathcal{O}_6$ and their stabilizer groups. The orbits of this family include an essential part of all $\mathcal{O}_6$ orbits.

math.CO

Twisted cubic and orbits of lines in $\mathrm{PG}(3,q)$, II

In the projective space $\mathrm{PG}(3,q)$, we consider the orbits of lines under the stabilizer group of the twisted cubic. In the literature, lines of $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits. In this paper, all classes of lines consisting of a unique orbit are found. For the remaining line types, with one exception, it is proved that they consist exactly of two or three orbits; sizes and structures of these orbits are determined. Also, the subgroups of the stabilizer group of the twisted cubic fixing lines of the orbits are obtained. Problems which remain open for one type of lines are formulated and, for $5\le q\le37$ and $q=64$, a solution is provided.

math.CO

Upper bounds on the length function for covering codes with covering radius $R$ and codimension $tR+1$

The length function $\ell_q(r,R)$ is the smallest length of a $ q $-ary linear code with codimension (redundancy) $r$ and covering radius $R$. In this work, new upper bounds on $\ell_q(tR+1,R)$ are obtained in the following forms: \begin{equation*} \begin{split} &(a)~\ell_q(r,R)\le cq^{(r-R)/R}\cdot\sqrt[R]{\ln q},~ R\ge3,~r=tR+1,~t\ge1, &\phantom{(a)~} q\text{ is an arbitrary prime power},~c\text{ is independent of }q. \end{split} \end{equation*} \begin{equation*} \begin{split} &(b)~\ell_q(r,R)< 3.43Rq^{(r-R)/R}\cdot\sqrt[R]{\ln q},~ R\ge3,~r=tR+1,~t\ge1, &\phantom{(b)~} q\text{ is an arbitrary prime power},~q\text{ is large enough}. \end{split} \end{equation*} In the literature, for $q=(q')^R$ with $q'$ a prime power, smaller upper bounds are known; however, when $q$ is an arbitrary prime power, the bounds of this paper are better than the known ones. For $t=1$, we use a one-to-one correspondence between $[n,n-(R+1)]_qR$ codes and $(R-1)$-saturating $n$-sets in the projective space $\mathrm{PG}(R,q)$. A new construction of such saturating sets providing sets of small size is proposed. Then the $[n,n-(R+1)]_qR$ codes, obtained by geometrical methods, are taken as the starting ones in the lift-constructions (so-called "$q^m$-concatenating constructions") for covering codes to obtain infinite families of codes with growing codimension $r=tR+1$, $t\ge1$.

cs.IT

Twisted cubic and point-line incidence matrix in $\mathrm{PG}(3,q)$

We consider the structure of the point-line incidence matrix of the projective space $\mathrm{PG}(3,q)$ connected with orbits of points and lines under the stabilizer group of the twisted cubic. Structures of submatrices with incidences between a union of line orbits and an orbit of points are investigated. For the unions consisting of two or three line orbits, the original submatrices are split into new ones, in which the incidences are also considered. For each submatrix (apart from the ones corresponding to a special type of lines), the numbers of lines through every point and of points lying on every line are obtained. This corresponds to the numbers of ones in columns and rows of the submatrices.

math.CO

On the weight distribution of the cosets of MDS codes

The weight distribution of the cosets of maximum distance separable (MDS) codes is considered. In 1990, P.G. Bonneau proposed a relation to obtain the full weight distribution of a coset of an MDS code with minimum distance $d$ using the known numbers of vectors of weights $\le d-2$ in this coset. In this paper, the Bonneau formula is transformed into a more structured and convenient form. The new version of the formula allows to consider effectively cosets of distinct weights $W$. (The weight $W$ of a coset is the smallest Hamming weight of any vector in the coset.) For each of the considered $W$ or regions of $W$, special relations more simple than the general ones are obtained. For the MDS code cosets of weight $W=1$ and weight $W=d-1$ we obtain formulas of the weight distributions depending only on the code parameters. This proves that all the cosets of weight $W=1$ (as well as $W=d-1$) have the same weight distribution. The cosets of weight $W=2$ or $W=d-2$ may have different weight distributions; in this case, we proved that the distributions are symmetrical in some sense. The weight distributions of the cosets of MDS codes corresponding to arcs in the projective plane $\mathrm{PG}(2,q)$ are also considered. For MDS codes of covering radius $R=d-1$ we obtain the number of the weight $W=d-1$ cosets and their weight distribution that gives rise to a certain classification of the so-called deep holes. We show that any MDS code of covering radius $R=d-1$ is an almost perfect multiple covering of the farthest-off points (deep holes); moreover, it corresponds to an optimal multiple saturating set in the projective space $\mathrm{PG}(N,q)$.

cs.IT

Twisted cubic and plane-line incidence matrix in $\mathrm{PG}(3,q)$

We consider the structure of the plane-line incidence matrix of the projective space $\mathrm{PG}(3,q)$ with respect to the orbits of planes and lines under the stabilizer group of the twisted cubic. Structures of submatrices with incidences between a union of line orbits and an orbit of planes are investigated. For the unions consisting of two or three line orbits, the original submatrices are split into new ones, in which the incidences are also considered. For each submatrix (apart from the ones corresponding to a special type of lines), the numbers of lines in every plane and planes through every line are obtained. This corresponds to the numbers of ones in columns and rows of the submatrices.

math.CO

Twisted cubic and orbits of lines in $\mathrm{PG}(3,q)$

In the projective space $\mathrm{PG}(3,q)$, we consider the orbits of lines under the stabilizer group of the twisted cubic. It is well known that the lines can be partitioned into classes every of which is a union of line orbits. All types of lines forming a unique orbit are found. For the rest of the line types (apart from one of them) it is proved that they form exactly two or three orbits; sizes and structures of these orbits are determined. Problems remaining open for one type of lines are formulated. For $5\le q\le37$ and $q=64$, they are solved.

math.CO

On cosets weight distributions of the doubly-extended Reed-Solomon codes of codimension 4

We consider the $[q+1,q-3,5]_q3$ generalized doubly-extended Reed-Solomon code of codimension $4$ as the code associated with the twisted cubic in the projective space $\mathrm{PG}(3,q)$. Basing on the point-plane incidence matrix of $\mathrm{PG}(3,q)$, we obtain the number of weight 3 vectors in all the cosets of the considered code. This allows us to classify the cosets by their weight distributions and to obtain these distributions. The weight of a coset is the smallest Hamming weight of any vector in the coset. For the cosets of equal weight having distinct weight distributions, we prove that the difference between the $w$-th components, $3<w\le q+1$, of the distributions is uniquely determined by the difference between the $3$-rd components. This implies an interesting (and in some sense unexpected) symmetry of the obtained distributions.

cs.IT

On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3

The weight of a coset of a code is the smallest Hamming weight of any vector in the coset. For a linear code of length $n$, we call integral weight spectrum the overall numbers of weight $w$ vectors, $0\le w\le n$, in all the cosets of a fixed weight. For maximum distance separable (MDS) codes, we obtained new convenient formulas of integral weight spectra of cosets of weight 1 and 2. Also, we give the spectra for the weight 3 cosets of MDS codes with minimum distance $5$ and covering radius $3$.

cs.IT