Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities

DOI10.1137/1.9781611975482.130zbMath1432.68140arXiv1710.10322OpenAlexW2951356926MaRDI QIDQ5236317

Sergey Yekhanin, Sivakanth Gopi, Venkatesan Guruswami

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.10322

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

New bounds on the field size for maximally recoverable codes instantiating grid-like topologies

This page was built for publication: Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities