New Multiple Insertion-Deletion Correcting Codes for Non-Binary Alphabets
Tuan A. Le, Hieu D. Nguyen

TL;DR
This paper extends Helberg's binary insertion-deletion correcting codes to non-binary alphabets and introduces a linear decoding algorithm for multiple deletions.
Contribution
It generalizes existing binary codes to non-binary alphabets and provides a linear decoding method for multiple deletions.
Findings
Successfully generalized codes to non-binary alphabets.
Developed a linear decoding algorithm for multiple deletions.
Achieved correction of multiple insertions and deletions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Advanced biosensing and bioanalysis techniques · Algorithms and Data Compression
