删除信道的平均情形重构:次多项式多道就足够了

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) Pub Date : 2017-08-01 DOI:10.1109/FOCS.2017.29

Y. Peres, Alex Zhai

{"title":"删除信道的平均情形重构:次多项式多道就足够了","authors":"Y. Peres, Alex Zhai","doi":"10.1109/FOCS.2017.29","DOIUrl":null,"url":null,"abstract":"The deletion channel takes as input a bit string x ∊ {0,1}^n, and deletes each bit independently with probability q, yielding a shorter string. The trace reconstruction problem is to recover an unknown string x ∊ from many independent outputs (called traces) of the deletion channel applied to x.We show that if x is drawn uniformly at random and q","PeriodicalId":311592,"journal":{"name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":"{\"title\":\"Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice\",\"authors\":\"Y. Peres, Alex Zhai\",\"doi\":\"10.1109/FOCS.2017.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The deletion channel takes as input a bit string x ∊ {0,1}^n, and deletes each bit independently with probability q, yielding a shorter string. The trace reconstruction problem is to recover an unknown string x ∊ from many independent outputs (called traces) of the deletion channel applied to x.We show that if x is drawn uniformly at random and q\",\"PeriodicalId\":311592,\"journal\":{\"name\":\"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"52\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FOCS.2017.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FOCS.2017.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 52

摘要

删除通道以一个位串x ∊作为输入;{0,1}^n，并以概率q独立删除每个位，产生更短的字符串。跟踪重建问题是恢复一个未知字符串x ∊从应用于x的删除通道的许多独立输出(称为跟踪)中，我们表明，如果x是随机均匀绘制的，q

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice

The deletion channel takes as input a bit string x ∊ {0,1}^n, and deletes each bit independently with probability q, yielding a shorter string. The trace reconstruction problem is to recover an unknown string x ∊ from many independent outputs (called traces) of the deletion channel applied to x.We show that if x is drawn uniformly at random and q

求助全文

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

来源期刊

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)

自引率

0.00%

发文量

期刊最新文献

On Learning Mixtures of Well-Separated Gaussians Obfuscating Compute-and-Compare Programs under LWE Minor-Free Graphs Have Light Spanners Lockable Obfuscation How to Achieve Non-Malleability in One or Two Rounds