Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
From MaRDI portal
Publication:4566493
DOI10.1109/TIT.2017.2730863zbMath1390.94913arXiv1605.08630OpenAlexW2963781977MaRDI QIDQ4566493
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.08630
Related Items (3)
Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction ⋮ Unnamed Item ⋮ Codes for Distributed Storage
This page was built for publication: Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
