Bounds for Deletion/insertion correcting codes

被引:32
|
作者
Levenshtein, VI [1 ]
机构
[1] RAS, Keldysh Inst Appl Math, Moscow 125047, Russia
关键词
D O I
10.1109/ISIT.2002.1023642
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Bounds for codes capable of correcting deletions and insertions are presented.
引用
收藏
页码:370 / 370
页数:1
相关论文
共 50 条
  • [1] On multiple insertion/deletion correcting codes
    Swart, TG
    Ferreira, HC
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 6 - 6
  • [2] On multiple insertion/deletion correcting codes
    Helberg, ASJ
    Ferreira, HC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (01) : 305 - 308
  • [3] Bounds and Constructions for Insertion and Deletion Codes
    Liu, Shu
    Xing, Chaoping
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (02) : 928 - 940
  • [4] Nonasymptotic Upper Bounds for Deletion Correcting Codes
    Kulkarni, Ankur A.
    Kiyavash, Negar
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (08) : 5115 - 5130
  • [5] Bounded Single Insertion/Deletion Correcting Codes
    Nozaki, Takayuki
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2379 - 2383
  • [6] A note on double insertion/deletion correcting codes
    Swart, TG
    Ferreira, HC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (01) : 269 - 273
  • [7] Further results on Insertion/Deletion correcting codes
    Clarke, WA
    Ferreira, HC
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 373 - 373
  • [8] NONBINARY CODES, CORRECTING SINGLE DELETION OR INSERTION
    TENENGOLTS, G
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (05) : 766 - 769
  • [9] BINARY CODES FOR CORRECTING DELETION INSERTION AND SUBSTITUTION ERRORS
    LEVENSHT.VI
    [J]. DOKLADY AKADEMII NAUK SSSR, 1965, 163 (04): : 845 - &
  • [10] Criss-Cross Insertion and Deletion Correcting Codes
    Bitar, Rawad
    Welter, Lorenz
    Smagloy, Ilia
    Wachter-Zeh, Antonia
    Yaakobi, Eitan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) : 7999 - 8015