Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2554797.2554813 | Proceedings of the 5th conference on Innovations in theoretical computer science |
Keywords | DocType | Volume |
available numerical evidence,asymptotically good tree code,new conjecture,significant-length communication,particular sum,effective construction,exponential sum | Conference | abs/1308.6007 |
Citations | PageRank | References |
14 | 0.73 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristopher Moore | 1 | 1765 | 160.55 |
| Leonard J. Schulman | 2 | 1328 | 136.88 |