Lecture 12: Cohen-Haeupler-Schulman explicit tree codes

Written on 07.07.2021 12:35 by Anand Narayanan

Hi all, 

on today's lecture, we will construct explicit tree codes of depth n with constant distance and 1/O(log log n) rate. The construction is due to Cohen-Haeupler-Schulman and uses the combinatorial Gessel-Viennot-Lindstrom lemma, which we will prove en route. 


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