Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length (Q2302600)

The \(i\)-th code symbol of a linear code \(C\) has locality \((r, \delta)\) if there exists a subset \(R_i \subseteq \{1,2,\dots,n \}\) such that \(i \in R_i\), \(|R_i| = r+\delta -1\), and the punctured code on these coordinates has minimum distance greater than or equal to \(\delta.\) The code \(C\) is called an \((r,\delta)\)-LRC (Locally Repairable Code) if every symbol in \(C\) has locality \((r,\delta)\). Such an \([n,k,d]\) code is said to be optimal if \(d = n -k+1 - ( \lceil \frac{k}{r} \rceil -1)(\delta -1)\), that is, it meets the Singleton type bound. The authors construct two classes of optimal cyclic \((r,\delta)\) LRCs with unbounded lengths and minimum distance \(\delta+1\) or \(\delta +2\) and using a stronger condition, they construct optimal cyclic \((r,\delta)\) LRCs with unbounded length and minimum distance \(2 \delta\).