A construction of optimal locally recoverable codes (Q6107453)

Linear codes of parameters \([n, k, n-k +1]\) are called MDS (maximum distance separable) codes. An \([n, k, n - k]\) linear code is said to be almost maximum distance separable (AMDS for short) and the code is referred to as a near maximum distance separable (NMDS) code if both this code and its dual are AMDS. A local recovery code (LRC) with locality \(r\) is a block code such that any symbol in the encoding is a function of \(r\) other symbols. For any \(i \in [n],\) if there always exist a subset \(R_i \subset [n]\setminus i\) with \(|R_i|= \)r and a function \(f_i(x_1, \ldots, x_r)\) over \(\mathbb{F}_{q}^r\) such that \(c_i = f_i(\textbf{c}_{R_i} )\) for any codeword \(c\in C,\) then \(C\) is referred to as an \((n, k, d, q; r)\)-LRC, where \(\textbf{c}_{R_i}\) is the projection of \(c\) at \(R_i\) and the set \(R_i\) is called the repair set. The objective of this work is to present a construction of NMDS codes with larger lengths. A family of \([q+5, 3, q+2]\) NMDS codes with \(q = 2m,\) where \(m\) is an odd integer with \(m\geq 3\) is constructed. This is achieved by using the \(3\times (q + 5)\) generator matrix \(G=\left( \begin{array}{cccccccc} 1 & \cdots & 1 & 0 & 0 & 1 & 0 & 1 \\ \alpha_0 & \cdots & \alpha_{q-1} & 0 & 1 & 0 & 1 & 1 \\ f(\alpha_0) & \cdots & f(\alpha_{q-1}) & 1 & 0 & 1 & 1 & 0 \\ \end{array}\right)\) for different oval polynomials \(f(x).\) The localities of these codes and their duals are determined. As a final result it's shown that these NMDS codes and their duals are both distance-optimal and dimension-optimal LRCs.