Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice
Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice
复制标题
删除通道的平均情况重建:次多项式多迹就足够了
DOI:
--
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
Alex Zhai
中科院分区:
文献类型:
--
作者:
Y. Peres;Alex Zhai
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