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

Sivakanth Gopi Venkatesan Guruswami Sergey Yekhanin

Published in: SODA (2019)

Keyphrases

lower bound
noise tolerant
upper bound
uniform distribution
boolean functions
objective function
optimal solution
concept class
concept classes
branch and bound
agnostic learning
membership queries
branch and bound algorithm
np hard
worst case
machine learning
pac learning
multi class
training data