Explicit Binary Tree Codes with Polylogarithmic Size Alphabet
Wednesday, February 14, 2018, 11:00am
In this talk, we consider the problem of explicitly constructing a binary tree code with constant distance and constant alphabet size. We give an explicit binary tree code with constant distance and alphabet size polylog(n), where n is the depth of the tr
Speaker: Gil Cohen
My name is Gil Cohen. I'm a research instructor at Princeton University. I spent a lovely year at Caltech as a postdoc and completed my Ph.D. at weizmann under the inspiring guidance of Ran Raz. I'm very excited to join Tel Aviv University in Fall '18!
Location : CoRE 301
Pranjal Awasthi and Shubhangi Saraf
Event Type: Seminar