Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
From MaRDI portal
Publication:5855143
DOI10.1109/TIT.2013.2288784zbMath1456.94137arXiv1210.6954MaRDI QIDQ5855143
A. S. Rawat, Natalia Silberstein, O. Ozan Koyluoglu, Sriram Vishwanath
Publication date: 15 March 2021
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6954
Related Items (21)
Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Linear programming bounds for distributed storage codes ⋮ New MRD codes from linear cutting blocking sets ⋮ Systematic maximum sum rank codes ⋮ Anticode-based locally repairable codes with high availability ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Two classes of optimal LRCs with information \((r, t)\)-locality ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ The complete hierarchical locality of the punctured simplex code ⋮ Locally recoverable codes correcting many erasures over small fields ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes ⋮ Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Computing sharp recovery structures for locally recoverable codes ⋮ Self-repairing codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves ⋮ A study of the performance of novel storage-centric repairable codes
This page was built for publication: Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
