Search

The deep holes of a linear code are the vectors that achieve the maximum error distance to the code. There has been extensive research on the topic of deep holes in Reed-Solomon codes. As a generalization of Reed-Solomon codes, we investigate the problem of deep holes of a class of twisted Reed-Solomon codes in this paper. The covering radius and a standard class of deep holes of twisted Reed-Solomon codes ${\rm TRS}_k(\mathcal{A}, \theta)$ are obtained for a general evaluation set $\mathcal{A} \subseteq \mathbb{F}_q$. Furthermore, we consider the problem of determining all deep holes of the full-length twisted Reed-Solomon codes ${\rm TRS}_k(\mathbb{F}_q, \theta)$. Specifically, we prove that there are no other deep holes of ${\rm TRS}_k(\mathbb{F}_q, \theta)$ for $\frac{3q-8}{4} \leq k\leq q-4$ when $q$ is even, and $\frac{3q+2\sqrt{q}-7}{4} \leq k\leq q-4$ when $q$ is odd. We also completely determine their deep holes for $q-3 \leq k \leq q-1$., Comment: This work has been submitted to the IEEE for possible publication

Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and basic results have been developed on this topic. Recently, locally repairable codes (LRCs) have attracted much attention due to their repair efficiency in large-scale distributed storage systems. In this paper, by employing the singleton procedure technique, we first provide a sufficient condition for bounding the minimum distance of cyclic codes with typical defining sets. Secondly, by considering a specific case, we establish a connection between bounds for the minimum distance of cyclic codes and solutions to a system of inequalities. This connection leads to the derivation of new bounds, including some with general patterns. In particular, we provide three new bounds with general patterns, one of which serves as a generalization of the Betti-Sala bound. Finally, we present a generalized lower bound for a special case and construct several families of $(2, \delta)$-LRCs with unbounded length and minimum distance $2\delta$. It turns out that these LRCs are distance-optimal, and their parameters are new. To the best of our knowledge, this work represents the first construction of distance-optimal $(r, \delta)$-LRCs with unbounded length and minimum distance exceeding $r+\delta-1$., Comment: 35 pages

Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $(2, \delta)$-LRCs over $\mathbb{F}_q$ with flexible parameters. Firstly, employing techniques from finite geometry, we introduce a simple yet useful condition to ensure that a punctured simplex code becomes a $(2, \delta)$-LRC. It is worth noting that this condition only imposes a requirement on the size of the puncturing set. Secondly, utilizing character sums over finite fields and Krawtchouk polynomials, we determine the parameters of more punctured simplex codes with puncturing sets of new structures. Several infinite families of LRCs with new parameters are derived. All of our new LRCs are optimal with respect to the generalized Cadambe-Mazumdar bound and some of them are also Griesmer codes or distance-optimal codes.

Locally repairable codes (LRCs) have emerged as an important coding scheme in distributed storage systems (DSSs) with relatively low repair cost by accessing fewer non-failure nodes. Theoretical bounds and optimal constructions of LRCs have been widely investigated. Optimal LRCs via cyclic and constacyclic codes provide significant benefit of elegant algebraic structure and efficient encoding procedure. In this paper, we continue to consider the constructions of optimal LRCs via cyclic and constacyclic codes with long code length. Specifically, we first obtain two classes of $q$-ary cyclic Singleton-optimal $(n, k, d=6;r=2)$-LRCs with length $n=3(q+1)$ when $3 \mid (q-1)$ and $q$ is even, and length $n=\frac{3}{2}(q+1)$ when $3 \mid (q-1)$ and $q \equiv 1(\bmod~4)$, respectively. To the best of our knowledge, this is the first construction of $q$-ary cyclic Singleton-optimal LRCs with length $n>q+1$ and minimum distance $d \geq 5$. On the other hand, an LRC acheiving the Hamming-type bound is called a perfect LRC. By using cyclic and constacyclic codes, we construct two new families of $q$-ary perfect LRCs with length $n=\frac{q^m-1}{q-1}$, minimum distance $d=5$ and locality $r=2$.

Constructions of optimal locally repairable codes (LRCs) achieving Singleton-type bound have been exhaustively investigated in recent years. In this paper, we consider new bounds and constructions of Singleton-optimal LRCs with minmum distance $d=6$, locality $r=3$ and minimum distance $d=7$ and locality $r=2$, respectively. Firstly, we establish equivalent connections between the existence of these two families of LRCs and the existence of some subsets of lines in the projective space with certain properties. Then, we employ the line-point incidence matrix and Johnson bounds for constant weight codes to derive new improved bounds on the code length, which are tighter than known results. Finally, by using some techniques of finite field and finite geometry, we give some new constructions of Singleton-optimal LRCs, which have larger length than previous ones.

Locally repairable codes (LRCs) with $(r,\delta)$ locality were introduced by Prakash \emph{et al.} into distributed storage systems (DSSs) due to their benefit of locally repairing at least $\delta-1$ erasures via other $r$ survival nodes among the same local group. An LRC achieving the $(r,\delta)$ Singleton-type bound is called an optimal $(r,\delta)$ LRC. Constructions of optimal $(r,\delta)$ LRCs with longer code length and determining the maximal code length have been an important research direction in coding theory in recent years. In this paper, we conduct further research on the improvement of maximum code length of optimal $(r,\delta)$ LRCs. For $2\delta+1\leq d\leq 2\delta+2$, our upper bounds largely improve the ones by Cai \emph{et al.}, which are tight in some special cases. Moreover, we generalize the results of Chen \emph{et al.} and obtain a complete characterization of optimal $(r=2, \delta)$-LRCs in the sense of geometrical existence in the finite projective plane $PG(2,q)$. Within this geometrical characterization, we construct a class of optimal $(r,\delta)$ LRCs based on the sunflower structure. Both the construction and upper bounds are better than previous ones., Comment: Submitted to the 2022 IEEE International Symposium on Information Theory (ISIT)

Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In general, it's difficult to determine the required number of maximally entangled states of an AEAQECC, which is associated with the dimension of the intersection of the two corresponding linear codes. Two linear codes are said to be a linear l-intersection pair if their intersection has dimension l. In this paper, all possible linear l-intersection pairs of MDS codes are given. As an application, we give a complete characterization of pure MDS AEAQECCs for all possible parameters.

Recently, the construction of new MDS Euclidean self-dual codes has been widely investigated. In this paper, for square q, we utilize generalized Reed-Solomon (GRS) codes and their extended codes to provide four generic families of q-ary MDS Euclidean self-dual codes. In particular, for large square q, our constructions take up a proportion of generally more than 34% in all the possible lengths of q-ary MDS Euclidean self-dual codes, which is larger than the previous results. Moreover, two new families of MDS Euclidean self-orthogonal codes and two new families of MDS Euclidean almost self-dual codes are given similarly.

The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a further study on the construction of MDS Euclidean self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The main idea of our construction is to choose suitable evaluation points such that the corresponding (extended) GRS codes are Euclidean self-dual. Firstly, we consider the evaluation set consists of two disjoint subsets, one of which is based on the trace function, the other one is a union of a subspace and its cosets. Then four new families of MDS Euclidean self-dual codes are constructed. Secondly, we give a simple but useful lemma to ensure that the symmetric difference of two intersecting subsets of finite fields can be taken as the desired evaluation set. Based on this lemma, we generalize our first construction and provide two new families of MDS Euclidean self-dual codes. Finally, by using two multiplicative subgroups and their cosets which have nonempty intersection, we present three generic constructions of MDS Euclidean self-dual codes with flexible parameters. Several new families of MDS Euclidean self-dual codes are explicitly constructed.

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider new constructions of MDS self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The critical idea of our constructions is to choose suitable evaluation points such that the corresponding (extended) GRS codes are self-dual. The evaluation set of our constructions is consists of a subgroup of finite fields and its cosets in a bigger subgroup. Four new families of MDS self-dual codes are obtained and they have better parameters than previous results in certain region. Moreover, by the Mobius action over finite fields, we give a systematic way to construct self-dual GRS codes with different evaluation points provided any known self-dual GRS codes. Specially, we prove that all the self-dual extended GRS codes over $\mathbb{F}_{q}$ with length $n< q+1$ can be constructed from GRS codes with the same parameters.

Although federated learning improves privacy of training data by exchanging local gradients or parameters rather than raw data, the adversary still can leverage local gradients and parameters to obtain local training data by launching reconstruction and membership inference attacks. To defend such privacy attacks, many noises perturbation methods (like differential privacy or CountSketch matrix) have been widely designed. However, the strong defence ability and high learning accuracy of these schemes cannot be ensured at the same time, which will impede the wide application of FL in practice (especially for medical or financial institutions that require both high accuracy and strong privacy guarantee). To overcome this issue, in this paper, we propose \emph{an efficient model perturbation method for federated learning} to defend reconstruction and membership inference attacks launched by curious clients. On the one hand, similar to the differential privacy, our method also selects random numbers as perturbed noises added to the global model parameters, and thus it is very efficient and easy to be integrated in practice. Meanwhile, the random selected noises are positive real numbers and the corresponding value can be arbitrarily large, and thus the strong defence ability can be ensured. On the other hand, unlike differential privacy or other perturbation methods that cannot eliminate the added noises, our method allows the server to recover the true gradients by eliminating the added noises. Therefore, our method does not hinder learning accuracy at all.

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q + 1 are also obtained., Comment: Accepted for publication in IEEE Transactions on Information Theory

Locally repairable codes with locality $r$ ($r$-LRCs for short) were introduced by Gopalan et al. \cite{1} to recover a failed node of the code from at most other $r$ available nodes. And then $(r,\delta)$ locally repairable codes ($(r,\delta)$-LRCs for short) were produced by Prakash et al. \cite{2} for tolerating multiple failed nodes. An $r$-LRC can be viewed as an $(r,2)$-LRC. An $(r,\delta)$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct $q$-ary optimal $(r,\delta)$-LRCs with length much larger than $q$. Surprisingly, Luo et al. \cite{3} presented a construction of $q$-ary optimal $r$-LRCs of minimum distances 3 and 4 with unbounded lengths (i.e., lengths of these codes are independent of $q$) via cyclic codes. In this paper, inspired by the work of \cite{3}, we firstly construct two classes of optimal cyclic $(r,\delta)$-LRCs with unbounded lengths and minimum distances $\delta+1$ or $\delta+2$, which generalize the results about the $\delta=2$ case given in \cite{3}. Secondly, with a slightly stronger condition, we present a construction of optimal cyclic $(r,\delta)$-LRCs with unbounded length and larger minimum distance $2\delta$. Furthermore, when $\delta=3$, we give another class of optimal cyclic $(r,3)$-LRCs with unbounded length and minimum distance $6$.

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and Hermitian construction. The minimum distances of our quantum MDS codes can be larger than q/2+1 Three of these six classes of quantum MDS codes have longer lengths than the ones constructed in [1] and [2], hence some of their results can be easily derived from ours via the propagation rule. Moreover, some known quantum MDS codes of specific lengths can be seen as special cases of ours and the minimum distances of some known quantum MDS codes are also improved as well., Comment: Accepted for publication in IEEE Transactions on Information Theory

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters \[ [[tq, tq-2d+2, d]]_{q} \] for any $1 \leq t \leq q, 2 \leq d \leq \lfloor \frac{tq+q-1}{q+1}\rfloor+1$, and \[ [[t(q+1)+2, t(q+1)-2d+4, d]]_{q} \] for any $1 \leq t \leq q-1, 2 \leq d \leq t+2$ with $(p,t,d) \neq (2, q-1, q)$. Our quantum codes have flexible parameters, and have minimum distances larger than $\frac{q}{2}+1$ when $t > \frac{q}{2}$. Furthermore, it turns out that our constructions generalize and improve some previous results., Comment: 14 pages. Accepted by Finite Fields and Their Applications

In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of a special class of words to certain Gabidulin codes., Comment: Published in Finite Fields and Their Applications