Efficient Capacity-Achieving Codes for General Repeat Channels-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Efficient Capacity-Achieving Codes for General Repeat Channels

Published:2022-06-26 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE International Symposium on Information Theory (ISIT)
language:
Short-container-title:

Author:

Pernice Francisco¹,Li Ray¹,Wootters Mary¹

Affiliation:

1. Stanford University

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9834325/9834269/09834386.pdf?arnumber=9834386

Reference15 articles.

1. Efficient near-optimal codes for general repeat channels;pernice,2022

2. Shannon’s theorems for channels with synchronization errors;dobrushin;Problemy Peredachi Informatsii,1967

3. A Mathematical Theory of Communication

4. Synchronization strings

5. Near-linear time insertion-deletion codes and (1+ ε )-approximating edit distance via indexing

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

1. Capacity Bounds for the Poisson-Repeat Channel;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

2. Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

3. Sequence Design and Reconstruction Under the Repeat Channel in Enzymatic DNA Synthesis;IEEE Transactions on Communications;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP