Tree Codes and a Conjecture on Exponential Sums
Computational Complexity
2013-12-11 v2 Information Theory
math.IT
Number Theory
Abstract
We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The available numerical evidence is consistent with the conjecture and is sufficient to certify codes for significant-length communications.
Keywords
Cite
@article{arxiv.1308.6007,
title = {Tree Codes and a Conjecture on Exponential Sums},
author = {Cristopher Moore and Leonard J. Schulman},
journal= {arXiv preprint arXiv:1308.6007},
year = {2013}
}
Comments
Proc. ITCS 2014