New Multiple Insertion-Deletion Correcting Codes for Non-Binary Alphabets

2015/02/09 by Le, Tuan A., Nguyen, Hieu D. · 1 citation
#94 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1502.02727

Abstract

We generalize Helberg's number-theoretic construction of multiple insertion-deletion correcting binary codes to non-binary alphabets and describe a linear decoding algorithm for correcting multiple deletions.

Cited by

• Efficient Decoding of Insertion and Deletion Errors for Helberg Codes

Related

• Efficient Decoding of Insertion and Deletion Errors for Helberg Codes
• A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
• An Improvement of Non-binary Code Correcting Single b-Burst of Insertions or Deletions
• Construction of optimal codes in deletion and insertion metric
• Optimal codes in deletion and insertion metric