Login / Signup
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities.
Sivakanth Gopi
Venkatesan Guruswami
Sergey Yekhanin
Published in:
IEEE Trans. Inf. Theory (2020)
Keyphrases
</>
lower bound
upper bound
noise tolerant
uniform distribution
objective function
branch and bound
decision lists
boolean functions
optimal solution
branch and bound algorithm
worst case
lower and upper bounds
pac learning
computational complexity
attribute efficient learning
agnostic learning