Locally Repairable Codes
From MaRDI portal
Publication:2983383
DOI10.1109/TIT.2014.2325570zbMath1360.94458arXiv1206.3804MaRDI QIDQ2983383
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3804
Related Items (23)
Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ On binary locally repairable codes with distance four ⋮ Linear programming bounds for distributed storage codes ⋮ Optimal selection for good polynomials of degree up to five ⋮ Anticode-based locally repairable codes with high availability ⋮ Two classes of optimal LRCs with information \((r, t)\)-locality ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ Unnamed Item ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ Locally recoverable codes correcting many erasures over small fields ⋮ RS-like locally recoverable codes with intersecting recovering sets ⋮ Unnamed Item ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Computing sharp recovery structures for locally recoverable codes ⋮ The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes ⋮ Self-repairing codes ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves ⋮ On the locality of quasi-cyclic codes over finite fields
This page was built for publication: Locally Repairable Codes
