Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities

DOI10.1109/TIT.2020.2990981zbMath1452.94113OpenAlexW3136350169MaRDI QIDQ5138793

Sergey Yekhanin, Sivakanth Gopi, 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://doi.org/10.1109/tit.2020.2990981

zbMATH Keywords

local reconstruction codes (LRC)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Information storage and retrieval of data (68P20) Informational aspects of data analysis and big data (94A16)

Related Items (5)

A construction of maximally recoverable codes ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture ⋮ Codes for Distributed Storage ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves

This page was built for publication: Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities