树码和关于指数和的一个猜想

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-08-27 DOI:10.1145/2554797.2554813

Cristopher Moore, L. Schulman

{"title":"树码和关于指数和的一个猜想","authors":"Cristopher Moore, L. Schulman","doi":"10.1145/2554797.2554813","DOIUrl":null,"url":null,"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.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Tree codes and a conjecture on exponential sums\",\"authors\":\"Cristopher Moore, L. Schulman\",\"doi\":\"10.1145/2554797.2554813\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":382856,\"journal\":{\"name\":\"Proceedings of the 5th conference on Innovations in theoretical computer science\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th conference on Innovations in theoretical computer science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2554797.2554813\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th conference on Innovations in theoretical computer science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2554797.2554813","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 35

摘要

我们提出了关于指数和的一个新猜想。在文献中显然没有考虑到这些特定的金额。根据这个猜想，我们得到了第一个渐近良好树码的有效构造。现有的数值证据与推测一致，足以证明有效长度通信的代码。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Tree codes and a conjecture on exponential sums

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 5th conference on Innovations in theoretical computer science

自引率

0.00%

发文量