共 50 条
- [42] Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (10): : 2176 - 2179
- [43] Codes for Correcting Three or More Adjacent Deletions or Insertions [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1246 - 1250
- [44] Asymptotically good codes correcting insertions, deletions, and transpositions [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 669 - 674
- [45] Optimal Codes Correcting a Burst of Deletions of Variable Length [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 757 - 762
- [47] Integer codes capable of correcting burst asymmetric errors [J]. Journal of Applied Mathematics and Computing, 2023, 69 : 771 - 784