Near MDS codes with dimension 4 and their application in locally recoverable codes
Maximum distance separable (MDS) codes are \([n,k,d]\) codes that meet the Singleton bound \(n\geq k+d-1.\) A near MDS (NMDS) code have minimum distance \(d=n-k\) and also its dual \(C^\bot\) almost meets the Singleton bound. For a block code, if any symbol in the encoding is a function of \(r\) other symbols, then this code is called a locally recoverable code (LRC for short) with locality \(r.\) Several infinite families of near MDS codes with dimension four are constructed with special matrixes and oval polynomials. Working in the field \(\mathbb{F}_q = \{\alpha_0=0,\alpha_1 = 1,\ldots, \alpha_{q-1}\},\) the first family has parameters \([q+3,4,q-1]\) arising from the generator matrix \(G_1=\left( \begin{array}{ccccccc} 1 & \cdots &1 & 1 & 0 & 0& 0\\ \alpha_1 & \cdots & \alpha_{q-1} & 0 & 1 & 0& 0\\ \alpha_1^2 & \cdots & \alpha_{q-1}^2 & 0 & 0 & 1& 0\\ \alpha_1^4 & \cdots & \alpha_{q-1}^4 & 0 & 0 & 0& 1\\ \end{array}\right).\) The NMDS property of this family is proven and its weight distribution is derived. The next family is generated by a \(4\times (q+3)\) matrix \(G_2\) that results from \(G_1\) by removing its last column. The authors show the parameters of these codes are \([q + 2,4,q - 2]\) thus showing the NMDS property. The weight distribution of this family is also found. The third family consist of NMDS codes with parameters \([q+1,4,q-3]\) generated by the matrix \(G_3\) that results from \(G_2\) by removing its last column. As an application, the duals of these near NMDS families of codes are proved to be both distance-optimal and dimension-optimal locally recoverable codes. For the entire collection see [Zbl 1516.11002].
- Constructions of near MDS codes which are optimal locally recoverable codes
- On binary locally repairable codes with distance four
- MDS and near-MDS codes via twisted Reed-Solomon codes
- Near-MDS codes over some small fields
- A matrix characterization of Near-MDS codes.
- Error Decoding of Locally Repairable and Partial MDS Codes
- On the extendibility of near-MDS elliptic codes
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
- Near-rings (MDS)- and Laguerre codes
- On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4
- A class of almost MDS codes
- A construction of optimal locally recoverable codes
- Almost MDS codes
- An Infinite Family of Linear Codes Supporting 4-Designs
- Bent vectorial functions and linear codes from o-polynomials
- Codes of small defect
- Constructions of near MDS codes which are optimal locally recoverable codes
- Designs from linear codes
- Difference sets and hyperovals
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Infinite Families of Near MDS Codes Holding t-Designs
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- Minimal linear codes over finite fields
- Near MDS codes from oval polynomials
- New quantum MDS codes with large minimum distance and short length from generalized Reed-Solomon codes
- On near-MDS codes
- On the Locality of Codeword Symbols
- On two classes of primitive BCH codes and some related codes
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- The minimum locality of linear codes
This page was built for publication: Near MDS codes with dimension 4 and their application in locally recoverable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169007)
