Explicit construction of q-ary 2-deletion correcting codes with low redundancy

• المؤلفون الرئيسيون: Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2024
• الموضوعات: Computer and Information Science; Insertion and Deletion; Efficient Construction; Error Correction
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/173448
• المؤسسة: Nanyang Technological University

We consider the problem of efficient construction of q -ary 2-deletion correcting codes with low redundancy. We show that our construction requires less redundancy than any existing efficiently encodable q -ary 2-deletion correcting codes. Precisely speaking, we present an explicit construction of a...