Abstract:
Optimal (r, δ) locally repairable codes ((r, δ)-LRCs for short) with length n | (q+1) have been studied in [5] and [6]. In this paper, along with their ideas, by using cy...Show MoreMetadata
Abstract:
Optimal (r, δ) locally repairable codes ((r, δ)-LRCs for short) with length n | (q+1) have been studied in [5] and [6]. In this paper, along with their ideas, by using cyclic or constacyclic codes, we construct three classes of such LRCs with new parameters which are not obtained in [5] and [6]. Thus, optimal (r, δ)-LRCs with length n | (q+1) and (r + δ - 1) | n are completely determined for all possible parameters.
Published in: 2018 IEEE Information Theory Workshop (ITW)
Date of Conference: 25-29 November 2018
Date Added to IEEE Xplore: 17 January 2019
ISBN Information: