Explicit construction of q-ary 2-deletion correcting codes with low redundancy
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...
Saved in:
Main Authors: | Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/173448 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Efficiently list-decodable insertion and deletion codes via concatenation
by: Liu, Shu, et al.
Published: (2022) -
A lower bound on the list-decodability of insdel codes
by: Liu, Shu, et al.
Published: (2023) -
On the watermark string in the davey-mackay construction
by: Nguyen, P.-M., et al.
Published: (2014) -
Characterization of frequencies and distribution of single nucleotide insertions/deletions in the human genome
by: Tan, E.-C., et al.
Published: (2014) -
New Lower Bounds and Constructions for Binary Codes Correcting Asymmetric Errors
by: Fu, F.-W., et al.
Published: (2014)