Towards deterministic tree code constructions
Mark Braverman · 2012
We present a deterministic operator on tree codes -- we call tree code product -- that allows one to deterministically combine two tree codes into a larger tree code. Moreover, if the original tree codes are efficiently encodable and decodable, then so is their product. This allows us to give the first deterministic subexponential-time construction of explicit tree codes: we are able to construct a tree code T of size n in time 2nε,. Moreover, T is also encodable and decodable in time 2nε,.