Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach

DOI10.1109/TIT.2020.3021707zbMath1457.94233arXiv1601.05595OpenAlexW3083398082MaRDI QIDQ5138908

Fang-Wei Fu, Jie Hao, Bin Chen, Kenneth W. Shum, Shutaong Xia, Yi-Xian Yang

Publication date: 4 December 2020

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

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

zbMATH Keywords

boundsconstructionsparity-check matricesSingleton-like boundlocally repairable code (LRC)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (8)

A characterization of optimal locally repairable codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ A characterization of optimal constacyclic locally repairable codes ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ Infinite families of optimal linear codes and their applications to distributed storage systems ⋮ Codes for Distributed Storage

This page was built for publication: Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach