Student lecture 11 (Braverman-Rao protocol)

Written on 30.06.2021 11:43 by Anand Narayanan

Hi all,

on today's class, two students will speak on the Braverman-Rao protocol, as a part of their final presentation. 

"Today we are going to describe a coding scheme by Braverman and Rao that has an optimal noise resilience while maintaining a constant rate. They proved the possibility to encode any communication protocol between two parties so that the protocol is successful even if a fraction of all symbols transmitted by the parties are corrupted adversarially, ¼-ε to be exact. We are going to have a quick recap on tree codes and then try to motivate you regarding the need of such protocol and try to explain it to you as simply as possible."


Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators.