The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2-Reference-Cited by-同舟云学术

The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2

Author:

Guruswami Venkatesan¹^ORCID,He Xiaoyu²^ORCID,Li Ray³^ORCID

Affiliation:

1. Departments of EECS and Mathematics, Simons Institute for the Theory of Computing, UC Berkeley, Berkeley, CA, USA

2. Department of Mathematics, Princeton University, Princeton, NJ, USA

3. Department of Computer Science, Stanford University, Stanford, CA, USA

Funder

NSF

Simons Investigator Award

Jacob Fox’s Packard Fellowship

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

Reference32 articles.

4. Sharp threshold rates for random codes;guruswami;Proc 12th Innov Theor Comput Sci Conf,2021

5. Beyond unique decoding: Topics in error-correcting codes;wang,2015

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constant Query Local Decoding against Deletions Is Impossible;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Survey for a Decade of Coding for DNA Storage;IEEE Transactions on Molecular, Biological, and Multi-Scale Communications;2024-06