Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes

DOI10.1109/TIT.2018.2854717MaRDI QIDQ4615363zbMATH OpenOpenAlexWikidataFDO

Authors Yuan Luo, Chaoping Xing, Chen Yuan

Publication date 28 January 2019

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

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

Mathematics Subject Classification ID

Cyclic codes (94B15)

Abstract: Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {it optimal} if it achieves the Singleton-type bound). In the breakthrough work of cite{TB14}, several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in cite{TB14} are upper bounded by the code alphabet size $q$. Recently, it was proved through extension of construction in cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ in cite{JMX17}. Surprisingly, cite{BHHMV16} presented a few examples of $q$-ary optimal locally repairable codes of small distance and locality with code length achieving roughly $q^2$. Very recently, it was further shown in cite{LMX17} that there exist $q$-ary optimal locally repairable codes with length bigger than $q+1$ and distance propositional to $n$. Thus, it becomes an interesting and challenging problem to construct new families of $q$-ary optimal locally repairable codes of length bigger than $q+1$. In this paper, we construct a class of optimal locally repairable codes of distance $3$ and $4$ with unbounded length (i.e., length of the codes is independent of the code alphabet size). Our technique is through cyclic codes with particular generator and parity-check polynomials that are carefully chosen.

Cited in

(32)

• Good polynomials for optimal LRC of low locality
• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Optimal cyclic locally repairable codes with unbounded length from their zeros
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• On binary locally repairable codes with distance four
• The minimum locality of linear codes
• Perfect LRCs and k-optimal LRCs
• Constructions of near MDS codes which are optimal locally recoverable codes
• Codes for Distributed Storage
• Codes in the sum-rank metric: fundamentals and applications
• A characterization of optimal locally repairable codes
• New upper bounds and constructions of multi-erasure locally recoverable codes
• A construction of optimal locally recoverable codes
• Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
• Near MDS codes with dimension 4 and their application in locally recoverable codes
• A characterization of optimal constacyclic locally repairable codes
• Optimal binary and ternary locally repairable codes with minimum distance 6
• On Singleton-type bound of locally repairable codes
• Constacyclic locally recoverable codes from their duals
• Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Optimal ternary locally repairable codes
• Four new families of NMDS codes with dimension 4 and their applications
• Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
• Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
• Quantum (r, )-locally recoverable codes
• Bounds on the size of (r,)-locally repairable codes for fixed values q and d
• Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
• A construction of optimal quasi-cyclic locally recoverable codes using constituent codes
• Two families of optimal quantum locally recoverable codes
• A family of cyclic codes with increasing dimensions and fixed minimum distances
• Cyclic (r, ) locally recoverable codes from their constacyclic and negacyclic subcodes

This page was built for publication: Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes

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