Asymptotically good codes correcting insertions, deletions, and transpositions

被引：86
|
作者：
Schulman, LJ [1 ]
Zuckerman, D
机构：
[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
[2] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1999年 / 45卷 / 07期
关键词：
asymptotically good; asynchronous communication; deletion; edit distance; error-correcting codes; insertion; transposition;
D O I：
10.1109/18.796406
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present simple, polynomial-time encodable and deeodable codes which are asymptotically good for channels allowing insertions, deletions, and transpositions. As a corollary, they achieve exponential error probability in a stochastic model of insertion-deletion.
引用
收藏
页码：2552 / 2557
页数：6
相关论文
共 50 条
  • [1] Asymptotically good codes correcting insertions, deletions, and transpositions
    Schulman, LJ
    Zuckerman, D
    [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 669 - 674
  • [2] Codes Correcting a Burst of Deletions or Insertions
    Schoeny, Clayton
    Wachter-Zeh, Antonia
    Gabrys, Ryan
    Yaakobi, Eitan
    [J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 630 - 634
  • [3] Codes Correcting a Burst of Deletions or Insertions
    Schoeny, Clayton
    Wachter-Zeh, Antonia
    Gabrys, Ryan
    Yaakobi, Eitan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (04) : 1971 - 1985
  • [4] Improved bounds for codes correcting insertions and deletions
    Yasunaga, Kenji
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (05) : 1267 - 1278
  • [5] Improved bounds for codes correcting insertions and deletions
    Kenji Yasunaga
    [J]. Designs, Codes and Cryptography, 2024, 92 : 1267 - 1278
  • [6] EFFICIENT LINEAR AND AFFINE CODES FOR CORRECTING INSERTIONS/DELETIONS
    Cheng, Kuan
    Guruswami, Venkatesan
    Haeupler, Bernhard
    Li, Xin
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 748 - 778
  • [7] Rate Efficient Codes Correcting a Burst of Deletions or Insertions
    Yi, Chen
    Han, Xuesong
    Li, Yong
    Zhou, Jihua
    He, Jiguang
    Li, Chunguo
    [J]. IEEE COMMUNICATIONS LETTERS, 2024, 28 (06) : 1253 - 1257
  • [8] Codes for Correcting Three or More Adjacent Deletions or Insertions
    Cheng, Ling
    Swart, Theo G.
    Ferreira, Hendrik C.
    Abdel-Ghaffar, Khaled A. S.
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1246 - 1250
  • [9] Interleaved Constrained Codes With Markers Correcting Bursts of Insertions or Deletions
    Smith, Dylan
    Swart, Theo G.
    Abdel-Ghaffar, Khaled A. S.
    Ferreira, Hendrik C.
    Cheng, Ling
    [J]. IEEE COMMUNICATIONS LETTERS, 2017, 21 (04) : 702 - 705
  • [10] Covering Codes for Insertions and Deletions
    Lenz, Andreas
    Rashtchian, Cyrus
    Siegel, Paul H.
    Yaakobi, Eitan
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 723 - 728
12345