Published January 2014
| public
Book Section - Chapter
Tree Codes and a Conjecture on Exponential Sums
- Creators
- Moore, Cristopher
-
Schulman, Leonard J.
- Other:
- Naor, Moni
Chicago
An error occurred while generating the citation.
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.
Additional Information
Copyright is held by the owner/author(s). Publication rights licensed to ACM. C.M. is supported by NSF grants CCF-1117426 and CCF- 1219117, and ARO contract W911NF-04-R-0009. L.J.S. is supported by NSF grant CCF-1038578. Many students' branch and bound implementations were very successful (23 students crossed the ℓ = 100 threshold); we thank all for their dedication and enthusiasm. Specific results are cited with permission. We also thank Alex Russell and Anup Rao for helpful discussions.Additional details
- Eprint ID
- 44557
- DOI
- 10.1145/2554797.2554813
- Resolver ID
- CaltechAUTHORS:20140331-152623727
- NSF
- CCF-1117426
- NSF
- CCF-1219117
- Army Research Office (ARO)
- W911NF-04-R-009
- NSF
- CCF-1038578
- Created
-
2014-04-01Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field