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 条
  • [21] Improved bounds for codes correcting insertions and deletions
    Yasunaga, Kenji
    DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (05) : 1267 - 1278
  • [22] Improved bounds for codes correcting insertions and deletions
    Kenji Yasunaga
    Designs, Codes and Cryptography, 2024, 92 : 1267 - 1278
  • [23] On Levenshtein's Reconstruction Problem Under Insertions, Deletions, and Substitutions
    Abu-Sini, Maria
    Yaakobi, Eitan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (11) : 7132 - 7158
  • [24] Pattern recognition of strings with substitutions, insertions, deletions and generalized transposition
    Oommen, BJ
    Loke, RKS
    PATTERN RECOGNITION, 1997, 30 (05) : 789 - 800
  • [25] Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions
    Carleton Univ, Ottawa, Canada
    Pattern Recognit, 1600, 5 (789-800):
  • [26] Asymptotically good codes correcting insertions, deletions, and transpositions
    Schulman, LJ
    Zuckerman, D
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 669 - 674
  • [27] Reed Solomon Codes Against Adversarial Insertions and Deletions
    Con, Roni
    Shpilka, Amir
    Tamo, Itzhak
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 2991 - 3000
  • [28] Asymptotically good codes correcting insertions, deletions, and transpositions
    Schulman, LJ
    Zuckerman, D
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2552 - 2557
  • [29] Rate Efficient Codes Correcting a Burst of Deletions or Insertions
    Yi, Chen
    Han, Xuesong
    Li, Yong
    Zhou, Jihua
    He, Jiguang
    Li, Chunguo
    IEEE COMMUNICATIONS LETTERS, 2024, 28 (06) : 1253 - 1257
  • [30] EFFICIENT LINEAR AND AFFINE CODES FOR CORRECTING INSERTIONS/DELETIONS
    Cheng, Kuan
    Guruswami, Venkatesan
    Haeupler, Bernhard
    Li, Xin
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 748 - 778
12345