Login / Signup
A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes.
Balaji Srinivasan Babu
P. Vijay Kumar
Published in:
CoRR (2017)
Keyphrases
</>
lower bound
upper bound
worst case
optimal solution
optimal cost
branch and bound
competitive ratio
branch and bound algorithm
constant factor
objective function
application level
access control
lower and upper bounds
np hard
random access
dynamic programming
optimal strategy
multi dimensional scaling