Positive Rate Binary Interactive Error Correcting Codes Resilient to >1/2 Adversarial Erasures

01/28/2022
āˆ™
by   Meghal Gupta, et al.
āˆ™
0
āˆ™

An interactive error correcting code (š—‚š–¤š–¢š–¢) is an interactive protocol with the guarantee that the receiver can correctly determine the sender's message, even in the presence of noise. This generalizes the concept of an error correcting code (š–¤š–¢š–¢), which is a non-interactive š—‚š–¤š–¢š–¢ that is known to have erasure resilience capped at 1/2. The work of <cit.> constructed the first š—‚š–¤š–¢š–¢ resilient to > 1/2 adversarial erasures. However, their š—‚š–¤š–¢š–¢ has communication complexity quadratic in the message size. In our work, we construct the first positive rate š—‚š–¤š–¢š–¢ resilient to > 1/2 adversarial erasures. For any ϵ > 0, our š—‚š–¤š–¢š–¢ is resilient to 6/11 - ϵ adversarial erasures and has size O_ϵ(n).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro