A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes.
Balaji Srinivasan BabuP. Vijay KumarPublished in: ISIT (2018)
Keyphrases
- lower bound
- worst case
- upper bound
- optimal solution
- optimal cost
- competitive ratio
- branch and bound
- objective function
- branch and bound algorithm
- constant factor
- np hard
- lower and upper bounds
- application level
- access control
- dynamic programming
- learning algorithm
- error correction
- multiple description coding
- provide an upper bound
- linear programming
- action recognition
- online algorithms
- sufficiently accurate