A characterization of optimal constacyclic locally repairable codes (Q6204325)

Consider a block code \(C\) of length \(n\). Denote by \([n]\) the set \(\lbrace 1, 2,\ldots,n\rbrace\). A linear code with parameters of code length \(n\), dimension \(k\) and minimum distance \(d\) over a finite field \(\mathbb{F}_q\) is referred to as a \(q\)-ary \([n,k,d]\) linear code. For each \(i \in [n]\), the \(i\)-th symbol has locality \(r\) if there exists an index set \(I_i \subset [n]-\lbrace i\rbrace\) with size at most \(r\) such that the \(i\)-th symbol can be determined by a deterministic function of the code symbols with indices in \(I_i\) . The code \(C\) is said to have (all-symbol) locality \(r\) if every code symbol has locality \(r\). In [\textit{P. Gopalan} et al., IEEE Trans. Inf. Theory 58, No. 11, 6925--6934 (2012; Zbl 1364.94603)] a Singleton-type bound is provided for an \([n,k,d]\) linear code with locality \(r\) \[ d\leq n-k-\lceil \frac{k}{r} \rceil+2, \] where \(\lceil x\rceil\) represents the smallest integer greater than or equal to \(x\). In this paper under review, the authors focus on constacyclic codes that attain equality in the above Singleton-type bound. These codes are \(d\)-optimal, and they are refered as optimal constacyclic LRCs. By considering the optimal constacyclic LRCs of length \(\eta\,p^s\) over finite fields \(\mathbb{F}_{p^m}\), \(s\) is a positive integer and \(\eta\) is a positive integer coprime to \(p\), the authors obtain several infinite classes of optimal constacyclic LRCs with new parameters. Furthermore, they completely characterize all the optimal constacyclic LRCs of length \(\eta\, p^s\) when \(x^\eta- \lambda_0\) is irreducible over \(F_{p^m}\).