Bounds and Constructions of Locally Repairable Codes: Parity-check Matrix Approach
نویسندگان
چکیده
A code symbol of a linear code is said to have locality r if this symbol could be recovered by at most r other code symbols. An (n, k, r) locally repairable code (LRC) with all symbol locality is a linear code with length n, dimension k, and locality r for all symbols. Recently, there are lots of studies on the bounds and constructions of LRCs, most of which are essentially based on the generator matrix of the linear code. Up to now, the most important bounds of minimum distance for LRCs might be the well-known Singleton-like bound and the Cadambe-Mazumdar bound concerning the field size. In this paper, we study the bounds and constructions of LRCs from views of parity-check matrices. Firstly, we set up a new characterization of the parity-check matrix for an LRC. Then, the proposed parity-check matrix is employed to analyze the minimum distance. We give an alternative simple proof of the well-known Singleton-like bound for LRCs with all symbol locality, and then easily generalize it to a more general bound, which essentially coincides with the Cadambe-Mazumdar bound and includes the Singleton-like bound as a specific case. Based on the proposed characterization of parity-check matrices, necessary conditions of meeting the Singleton-like bound are obtained, which naturally lead to a construction framework of good LRCs. Finally, two classes of optimal LRCs based on linearized polynomial theories and Vandermonde matrices are obtained under the construction framework.
منابع مشابه
Locally Repairable and Locally Regenerating Codes by Parity-Splitting of HashTag Codes
We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length α (also called a sub-packetization level)...
متن کاملOptimal locally repairable codes of distance 3 and 4 via cyclic codes
Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of [14], several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in [14] are upper bounded by the code alphabet...
متن کاملBounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes the systems computationally expensive and difficult to maintain. Here, we study linear locally repairable codes over the binary field, tolerating m...
متن کاملConstruction of optimal locally repairable codes via automorphism groups of rational function fields
Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS co...
متن کاملOn Sequential Locally Repairable Codes
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1601.05595 شماره
صفحات -
تاریخ انتشار 2016