A class of almost MDS codes
Introduction
In coding theory, the Singleton bound is an upper bound on the size of an arbitrary linear code with length n, size M, and minimum distance d. For an code, the Singleton bound says that . If this equality holds, i.e., , then the code is called an maximum distance separable (MDS) code. If , then the code is called an almost MDS (AMDS for short) code [10]. A code is said to be a near MDS (NMDS for short) code if the code and its dual code both are AMDS. MDS codes achieve optimal parameters that allow correction of maximal number of errors for a given code rate [6]. MDS and AMDS codes have important applications in communications, data storage, combinatorial theory, and secret sharing [12].
In many cases, BCH codes are the best linear codes. In the past ten years, a lot of progress on the study of BCH codes has been made (see, for example, [7][8][9][11][16]). Recently, Ding and Tang studied a class of BCH codes with , length , design distance and , and proved this class of BCH codes are NMDS codes [2]. They also obtained infinite families of 3-designs from the proposed NMDS codes. Inspired by the work of Ding and Tang, the objective of this paper is to present a class of AMDS codes from the BCH codes and determine their parameters. It turns out the proposed AMDS codes are distance-optimal and dimension-optimal locally repairable codes, which have important applications in distributed storage systems and receive a lot of attention in recent years [14][15][5][1][13]. The parameters of the duals of this class of AMDS codes are also discussed.
The rest of this paper is organized as follows. In Section 2, we present some preliminaries on cyclic codes, BCH codes, AMDS codes, NMDS codes and locally repairable codes. In Section 3, we propose a new class of AMDS codes from BCH codes over with m being odd. Section 4 is devoted to some concluding remarks.
Section snippets
Cyclic codes, BCH codes, almost MDS codes and near MDS codes
An code over is said to be cyclic if implies . By identifying any vector with , any code of length n over corresponds to a subset of the quotient ring . A linear code is cyclic if and only if the corresponding subset in is an ideal of the ring .
Note that every ideal of is principal. Let be a cyclic
A class of AMDS codes
Throughout this section, let , where m is odd. In this section, we consider a new class of BCH code over and its dual, and prove that is an AMDS code.
The following lemma will be useful in the sequel whose proof is straightforward. Lemma 3.1 Let . Then
We will also need the following lemma.
Lemma 3.2 Let with m being odd. Let denote the set of all -th roots of unity in . Suppose
Summary and concluding remark
The contribution of this paper was the study of the BCH code in Section 3, where the parameters of the code were determined, and a bound on the minimum distance of the dual of the code was given. Furthermore, the code over is a distance-optimal and dimension-optimal LRC. It would be possible to obtain more AMDS codes from some other BCH codes. Finally, we invite the reader to prove or disprove Conjecture 3.6.
Acknowledgements
The authors would like to thank the Editor and the anonymous Reviewers for giving us invaluable comments and suggestions that greatly improved the quality of this paper. This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 62071397 and 11971395, and also supported in part by projects of central government to guide local scientific and technological development under Grant No. 2021ZYD0001.
References (16)
- et al.
Some binary BCH codes with length
Finite Fields Appl.
(2019) - et al.
Bounds on the size of locally recoverable codes
IEEE Trans. Inf. Theory
(Nov. 2015) - et al.
Infinite families of near MDS codes holding t-designs
IEEE Trans. Inf. Theory
(2020) - et al.
On near-MDS codes
J. Geom.
(1995) - et al.
Codes of small defect
Des. Codes Cryptogr.
(March 1997) - et al.
On the locality of codeword symbols
IEEE Trans. Inf. Theory
(Aug. 2012) - et al.
Fundamentals of Error-Correcting Codes
(2003) - et al.
On two classes of primitive BCH codes and some related codes
IEEE Trans. Inf. Theory
(June 2009)
Cited by (12)
Near-MDS codes from maximal arcs in PG(2,q)
2024, Finite Fields and their ApplicationsNear MDS codes of non-elliptic-curve type from Reed-Solomon codes
2023, Discrete MathematicsConstructions of near MDS codes which are optimal locally recoverable codes
2023, Finite Fields and their ApplicationsRoth-Lempel NMDS Codes of Non-Elliptic-Curve Type
2023, IEEE Transactions on Information TheoryA construction of optimal locally recoverable codes
2023, Cryptography and Communications