Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes

DOI10.1109/TIT.2022.3203591MaRDI QIDQ6196089

Gaojun Luo, San Ling, Martianus Frederic Ezerman

Publication date: 14 March 2024

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

distributed storage systemmatrix-product codemaximum distance separable codelocally repairable code

Mathematics Subject Classification ID

Could not fetch data.

Related Items (5)

On Singleton-type bound of locally repairable codes ⋮ On the \(\sigma\) duals and \(\sigma\) hulls of linear codes ⋮ Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes ⋮ Optimal ternary locally repairable codes ⋮ Optimal \((2, \delta)\) locally repairable codes via punctured simplex codes

This page was built for publication: Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196089)