New Constructions of Optimal Locally Repairable Codes With Super-Linear Length

DOI10.1109/TIT.2021.3103330MaRDI QIDQ5032512zbMATH OpenOpenAlexFDO

Authors Xiangliang Kong, Xin Wang, Gennian Ge

Publication date 17 February 2022

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

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

Mathematics Subject Classification ID

Other types of codes (94B60)

Abstract: As an important coding scheme in modern distributed storage systems, locally repairable codes (LRCs) have attracted a lot of attentions from perspectives of both practical applications and theoretical research. As a major topic in the research of LRCs, bounds and constructions of the corresponding optimal codes are of particular concerns. In this work, codes with $(r,delta)$-locality which have optimal minimal distance w.r.t. the bound given by Prakash et al. cite{Prakash2012Optimal} are considered. Through parity check matrix approach, constructions of both optimal $(r,delta)$-LRCs with all symbol locality ($(r,delta{)}_a$-LRCs) and optimal $(r,delta)$-LRCs with information locality ($(r,delta{)}_i$-LRCs) are provided. As a generalization of a work of Xing and Yuan cite{XY19}, these constructions are built on a connection between sparse hypergraphs and optimal $(r,delta)$-LRCs. With the help of constructions of large sparse hypergraphs, the length of codes constructed can be super-linear in the alphabet size. This improves upon previous constructions when the minimal distance of the code is at least $3delta+1$. As two applications, optimal H-LRCs with super-linear length and GSD codes with unbounded length are also constructed.

Cited in

(12)

• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Optimal cyclic locally repairable codes with unbounded length from their zeros
• On Optimal Locally Repairable Codes With Super-Linear Length
• Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
• On Singleton-type bound of locally repairable codes
• Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Weight distributions of two classes of optimal (r, )-locally repairable codes
• Quantum (r, )-locally recoverable codes
• A family of self-orthogonal divisible codes with locality 2
• Optimal array codes with hierarchical locality
• LRCS: duality, LP bounds, and field size
• Optimal quantum (r, )-locally repairable codes via classical ones

This page was built for publication: New Constructions of Optimal Locally Repairable Codes With Super-Linear Length

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