Construction of Binary Locally Repairable Codes with Nonuniform Locality and Availability Using Combinatorial Designs [PDF]
EntropyIn this paper, we generalize the construction of locally repairable codes (LRCs) by leveraging pairwise balanced designs (PBDs) and balanced incomplete block designs (BIBDs) to construct codes with nonuniform locality or nonuniform availability.
Yu Zhang, Xiangqiong Zeng
doaj +3 more sources
Optimal $$(r,\delta )$$-LRCs from monomial-Cartesian codes and their subfield-subcodes
Designs, Codes, and Cryptography, 2023 AbstractWe study monomial-Cartesian codes (MCCs) which can be regarded as $$(r,\delta )$$ ( r , δ ) -locally recoverable codes (LRCs).
CARLOS Galindo +2 more
exaly +5 more sources
New constructions of optimal (r,δ)-LRCs via good polynomials
Finite Fields and Their Applications, 2023 Locally repairable codes (LRCs) are a class of erasure codes that are widely used in distributed storage systems, which allow for efficient recovery of data in the case of node failures or data loss. In 2014, Tamo and Barg introduced Reed-Solomon-like (RS-like) Singleton-optimal $(r,δ)$-LRCs based on polynomial evaluation.
Yuan Gao
exaly +4 more sources
Singleton-Optimal LRCs and Perfect LRCs via Cyclic Codes
2021 IEEE International Symposium on Information Theory (ISIT), 2021 Locally repairable codes (LRCs) have emerged as an important coding scheme in distributed storage systems (DSSs) with relatively low repair cost by accessing fewer non-failure nodes. Theoretical bounds and optimal constructions of LRCs have been widely investigated.
Weijun Fang, Shu-Tao Xia, Fang-Wei Fu
exaly +4 more sources
Some Results on the Improved Bound and Construction of Optimal $(r,\ \delta)$ LRCs
2022 IEEE/CIC International Conference on Communications in China (ICCC), 2022 Comment: Submitted to the 2022 IEEE International Symposium on Information Theory (ISIT)
Weijun Fang, Shu-Tao Xia, Fang-Wei Fu
exaly +5 more sources
Constructions of ternary LRCs with optimal distance
Journal of Physics: Conference Series, 2020 Abstract As a new class of erasure codes, locally repairable codes (LRCs) can provide data repair capability for distributed storage system. In this paper, we firstly propose an effective construction method to obtain optimal LRCs based on ternary optimal codes.
Ruihu Li
exaly +2 more sources
Singleton-Type Optimal LRCs with Minimum Distance 3 and 4 from Projective Code
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2021 Qiang Fu, Ruihu Li, Luobin Guo
exaly +2 more sources
New Design and Analysis of Error-Resilient LRCs for DSSs With Silent Disk Errors
IEEE Access, 2021 Recently, erasure coding techniques are considered as essential schemes for the reliability of the modern distributed storage systems (DSSs) with the frequent node-level failure.
Chanki Kim, Jong-Seon No
doaj +1 more source
Constructions of Binary Locally Repairable Codes With Multiple Recovering Sets
IEEE Access, 2021 Locally repairable codes (LRCs) with multiple recovering sets are highly demanded in distributed storage systems. In this letter, we generalize the construction of WZL code proposed by Wang et al.
Jiaming Teng, Lingfei Jin
doaj +1 more source
New Constructions of Short Length Binary Locally Repairable Codes
IEEE Access, 2020 In this short paper, our main objective is to construct binary locally repairable codes (LRCs) with good properties. Two constructions of LRCs with short lengthes are proposed.
Sen Yang, Ruihu Li, Qiang Fu, Jingjie Lv
doaj +1 more source