How Long Can Optimal Locally Repairable Codes Be?
From MaRDI portal
Publication:5224022
DOI10.1109/TIT.2019.2891765zbMath1432.94213arXiv1807.01064OpenAlexW2963890921MaRDI QIDQ5224022
Xing, Chaoping, Chen Yuan, Venkatesan Guruswami
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.01064
Related Items (13)
Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ On binary locally repairable codes with distance four ⋮ Unnamed Item ⋮ A characterization of optimal locally repairable 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 ⋮ Locally recoverable \(J\)-affine variety codes ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: How Long Can Optimal Locally Repairable Codes Be?
