ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair

DOI10.1109/TIT.2020.3023110zbMath1453.94143arXiv1807.01166OpenAlexW3085694278MaRDI QIDQ5138853

Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman, Venkatesan Guruswami

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/1807.01166

zbMATH Keywords

maximum distance separable codesepsilon-minimum storage regenerating codesexact regeneration of single code block

Mathematics Subject Classification ID

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

Related Items (3)

Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction ⋮ Multilinear Algebra for Distributed Storage ⋮ Functional repair codes: a view from projective geometry

This page was built for publication: ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair