A class of almost MDS codes (Q2668084)

For a linear code of parameters \([n, k, d],\) the Singleton bound says that \(d \leq n-k+1.\) If this equality holds, i.e., \(d =n-k+1,\) then the code is called a maximum distance separable (MDS) code. If \(d =n-k,\) then the code is called an almost MDS (AMDS for short) code. A code is said to be a near MDS (NMDS for short) code if the code and its dual code both are AMDS. Recently, \textit{C. Ding} and \textit{C. Tang} [IEEE Trans. Inf. Theory 66, No. 9, 5419--5428 (2020; Zbl 1448.94257)] studied a class of BCH codes \(C(q,n,\delta,h)\) with \(q=3^m,\) length \(n =q+1,\) designed distance \(\delta=3\) and \(h =1\). They proved [loc. cit.] this class of BCH codes are NMDS codes. Inspired by the work of Ding and Tang, in the paper under review, the authors present a class of AMDS codes from the BCH codes \(C(q,q+1,3,4)\) and determine their parameters (Theorem 3.3). Moreover, the authors also show (see Theorem 3.4) that the AMDS codes \(C(q,q+1,3,4)\) above is distance-optimal, namely the distance attains the bound in Lemma 2.2, and dimension-optimal, namely the dimension attains the bound in Lemma 2.3, locally repairable codes.