Login / Signup

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures.

Balaji Srinivasan BabuGanesh R. KiniP. Vijay Kumar
Published in: IEEE Trans. Inf. Theory (2020)
Keyphrases
  • upper bound
  • lower bound
  • small number
  • worst case
  • matching algorithm
  • maximum number
  • sampling rate
  • computer vision
  • computational complexity
  • matching process
  • space complexity