An exponential lower bound on the sub-packetization of MSR codes.
Omar AlrabiahVenkatesan GuruswamiPublished in: STOC (2019)
Keyphrases
- lower bound
- upper bound
- average case complexity
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- action recognition
- error correction
- sufficiently accurate
- worst case
- np hard
- application level
- linear programming relaxation
- ip networks
- lower bounding
- objective function
- optimal solution
- multiple description coding
- error correcting codes
- bitstream
- average case
- sample complexity
- video streaming