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...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping
Övriga upphovsmän: Nanyang Technopreneurship Center
Materialtyp: Journal Article
Språk:English
Publicerad: 2022
Ämnen:
Länkar:https://hdl.handle.net/10356/157154