Constructions of Optimal Cyclic ({r},{\delta }) Locally Repairable Codes

DOI10.1109/TIT.2017.2761120MaRDI QIDQ4569199zbMATH OpenOpenAlexFDO

Authors Bin Chen, Jie Hao, Fangwei Fu, Shutaong Xia

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.01136

Mathematics Subject Classification ID

Cyclic codes (94B15)

Abstract: A code is said to be a $r$-local locally repairable code (LRC) if each of its coordinates can be repaired by accessing at most $r$ other coordinates. When some of the $r$ coordinates are also erased, the $r$-local LRC can not accomplish the local repair, which leads to the concept of $(r,delta)$-locality. A $q$-ary $[n,k]$ linear code $cC$ is said to have $(r,delta)$-locality ($deltage2$) if for each coordinate $i$, there exists a punctured subcode of $cC$ with support containing $i$, whose length is at most $r+delta-1$, and whose minimum distance is at least $delta$. The $(r,delta)$-LRC can tolerate $delta-1$ erasures in total, which degenerates to a $r$-local LRC when $delta=2$. A $q$-ary $(r,delta)$ LRC is called optimal if it meets the Singleton-like bound for $(r,delta)$-LRCs. A class of optimal $q$-ary cyclic $r$-local LRCs with lengths $nmidq-1$ were constructed by Tamo, Barg, Goparaju and Calderbank based on the $q$-ary Reed-Solomon codes. In this paper, we construct a class of optimal $q$-ary cyclic $(r,delta)$-LRCs ($deltage2$) with length $nmidq-1$, which generalizes the results of Tamo emph{et al.} Moreover, we construct a new class of optimal $q$-ary cyclic $r$-local LRCs with lengths $nmidq+1$ and a new class of optimal $q$-ary cyclic $(r,delta)$-LRCs ($deltage2$) with lengths $nmidq+1$. The constructed optimal LRCs with length $n=q+1$ have the best-known length $q+1$ for the given finite field with size $q$ when the minimum distance is larger than $4$.

Cited in

(15)

• Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Optimal ternary locally repairable codes
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Optimal cyclic locally repairable codes with unbounded length from their zeros
• Locally recoverable \(J\)-affine variety codes
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• Constacyclic locally recoverable codes from their duals
• Codes for Distributed Storage
• Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
• A characterization of optimal constacyclic locally repairable codes
• Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
• Locally repairable codes with multiple repair sets based on packings of block size 4
• New upper bounds and constructions of multi-erasure locally recoverable codes
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes

This page was built for publication: Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569199)