Efficiently list-decodable insertion and deletion codes via concatenation
In this paper, we consider the list decoding property of codes under insertion and deletion errors (insdel for short). Firstly, we analyse the list decodability of random insdel codes. Our result provides a more complete picture on the list decodability of insdel codes when both insertion and deleti...
Saved in:
Main Authors: | Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping |
---|---|
Other Authors: | Nanyang Technopreneurship Center |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/157154 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A lower bound on the list-decodability of insdel codes
by: Liu, Shu, et al.
Published: (2023) -
Generalized concatenation for quantum codes
by: Grassl, M., et al.
Published: (2014) -
Explicit construction of q-ary 2-deletion correcting codes with low redundancy
by: Liu, Shu, et al.
Published: (2024) -
Quantum codes from concatenated algebraic-geometric codes
by: Chen, H., et al.
Published: (2014) -
Reliability and Throughput Analysis of a Concatenated Coding System
by: DENG, Robert H., et al.
Published: (1987)