Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
From MaRDI portal
Publication:5375529
DOI10.1109/TIT.2018.2800042zbMath1395.94331arXiv1702.02685OpenAlexW3103400821MaRDI QIDQ5375529
Itzhak Tamo, Abhishek Agarwal, Arya Mazumdar, Alexander Barg, Sihuang Hu
Publication date: 14 September 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.02685
Related Items (10)
Linear programming bounds for distributed storage codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ The complete hierarchical locality of the punctured simplex code ⋮ Locally recoverable \(J\)-affine variety codes ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Codes for Distributed Storage
This page was built for publication: Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
