Polar Codes for Channels with Insertions, Deletions, and Substitutions

被引：4
|
作者：
Pfister, Henry D. [1 ]
Tal, Ido [2 ]
机构：
[1] Duke Univ, Durham, NC 27706 USA
[2] Technion, Haifa, Israel
来源：
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2021年
关键词：
D O I：
10.1109/ISIT45174.2021.9517755
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper presents a coding scheme for an insertion deletion substitution channel. We extend a previous scheme for the deletion channel where polar codes are modified by adding "guard bands" between segments. In the new scheme, each guard band is comprised of a middle segment of '1' symbols, and left and right segments of '0' symbols. Our coding scheme allows for a regular hidden-Markov input distribution, and achieves the information rate between the input and corresponding output of such a distribution. Thus, we prove that our scheme can be used to efficiently achieve the capacity of the channel. The probability of error of our scheme decays exponentially in the cube-root of the block length.
引用
收藏
页码：2554 / 2559
页数：6
相关论文
共 50 条
  • [1] Convolutional codes for channels with substitutions, insertions, and deletions
    Mansour, MF
    Tewfik, AH
    GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 1051 - 1055
  • [2] Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions
    Fertonani, Dario
    Duman, Tolga M.
    Erden, M. Fatih
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (01) : 2 - 6
  • [3] Marker codes for channels with insertions and deletions
    Ratzer, EA
    ANNALS OF TELECOMMUNICATIONS, 2005, 60 (1-2) : 29 - 44
  • [4] Polar Codes for Channels with Deletions
    Tian, Kuangda
    Fazeli, Arman
    Vardy, Alexander
    Liu, Rongke
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 572 - 579
  • [5] Reliable communication over channels with insertions, deletions, and substitutions
    Davey, MC
    MacKay, DJC
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 687 - 698
  • [6] DECODING FOR CHANNELS WITH INSERTIONS, DELETIONS, AND SUBSTITUTIONS WITH APPLICATIONS TO SPEECH RECOGNITION
    BAHL, LR
    JELINEK, F
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) : 404 - 411
  • [7] Reduced-Complexity Successive-Cancellation Decoding for Polar Codes on Channels With Insertions and Deletions
    Sun, He
    Liu, Rongke
    Tian, Kuangda
    Dai, Bin
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (01) : 45 - 58
  • [8] Feature Point Based Image Watermarking with Insertions, Deletions and Substitutions Codes
    Bardyn, Dieter
    Belet, Philippe
    Dams, Tim
    Dooms, Ann
    Schelkens, Peter
    MEDIA FORENSICS AND SECURITY II, 2010, 7541
  • [9] Covering Codes for Insertions and Deletions
    Lenz, Andreas
    Rashtchian, Cyrus
    Siegel, Paul H.
    Yaakobi, Eitan
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 723 - 728
  • [10] Optimal Interactive Coding for Insertions, Deletions, and Substitutions
    Sherstov, Alexander A.
    Wu, Pei
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (10) : 5971 - 6000
12345