Simple proof the generalized Helberg codes being capable of correcting insertion/deletion errors

被引：0
|
作者：
Ma G. [1 ]
Jiao X. [1 ]
Mu J. [1 ]
Han H. [1 ]
Guo J. [2 ]
机构：
[1] School of Computer Science and Technology, Xidian University, Xi'an
[2] School of Computer Science and Engineering, Xi'an Technological University, Xi'an
来源：
Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University | 2020年 / 47卷 / 06期
关键词：
Error-correcting codes; Generalized Helberg codes; Helberg codes; Insertion/deletion errors;
D O I：
10.19665/j.issn1001-2400.2020.06.022
中图分类号：
学科分类号：
摘要：
Since the existing proof method of the error correction capability for generalized Helberg codes is complicated, a simple proof that generalized Helberg codes are capable of correcting multiple insertion/deletion errors is proposed. By making a detailed analysis of the monotonicity of the inner product between the codeword and the weights for the generalized Helberg codes, the upper and lower bounds of the difference of the inner product between any two different codewords and weights are proved. By using the upper and lower bounds, the existing proof method for the error correction capability for generalized Helberg codes is simplified. The proposed simple proof is helpful in understanding generalized Helberg codes and making a further study. © 2020, The Editorial Board of Journal of Xidian University. All right reserved.
引用
收藏
页码：158 / 163
页数：5
相关论文
共 17 条
  • [1] MERCIER H, BHARGAVA V K, TAROKH V., A Survey of Error-correcting Codes for Channels with Symbol Synchronization Errors, IEEE Communications Surveys and Tutorials, 12, 1, pp. 87-96, (2010)
  • [2] YANG G, BARBERO A I, ROSNES E, Et al., Error Correction on an Insertion/deletion Channel Applying Codes from RFID Standards, Proceedings of the 2012 Information Theory and Applications Workshop, pp. 137-142, (2012)
  • [3] CHEE Y M, KIAH H M, VARDY A, Et al., Coding for Racetrack Memories, IEEE Transactions on Information Theory, 64, 11, pp. 7094-7112, (2018)
  • [4] LENZ A, SIEGEL P H, WACHTER-ZEH A, Et al., Coding over Sets for DNA Storage, Proceedings of the 2018 IEEE International Symposium on Information Theory, pp. 2411-2415, (2018)
  • [5] ZHANG Zhaoji, LI Ying, Asymmetric Spatially-coupled LDPC Codes for Burst Erasure Channels, Journal of Xidian University, 44, 5, pp. 1-6, (2017)
  • [6] HANNA S K, El ROUAYHEB S., Guess Check Codes for Deletions, Insertions, and Synchronization, IEEE Transactions on Information Theory, 65, 1, pp. 3-15, (2019)
  • [7] VARSHAMOV R R, TENENGOLTS G M., Codes Which Correct Single Asymmetric Errors, Automation and Remote Control, 26, 2, pp. 286-290, (1965)
  • [8] LEVENSHTEIN V I., Binary Codes Capable of Correcting Deletions, Insertions, and Reversals, Soviet Physics Doklady, 10, 8, pp. 707-710, (1966)
  • [9] HELBERG A S J, FERREIRA H C., On Multiple Insertion/deletion Correcting Codes, IEEE Transactions on Information Theory, 48, 1, pp. 305-308, (2002)
  • [10] LE T A, NGUYEN H D., New Multiple Insertion/deletion Correcting Codes for Non-binary Alphabets, IEEE Transactions on Information Theory, 62, 5, pp. 2682-2693, (2016)
12