Relaxed Locally Correctable Codes in Computationally Bounded Channels

Abstract

Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications. The goal is to obtain the best possible tradeoffs between the number of queries the algorithm makes to its oracle (the locality of the task), and the amount of redundancy in the… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics