A lower bound on the list-decodability of insdel codes

• Main Authors: Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping
• Other Authors: School of Computer Science and Engineering
• Format: Article
• Language: English
• Published: 2023
• Subjects: Science::Mathematics::Applied mathematics::Information theory; Engineering::Computer science and engineering::Data::Coding and information theory; Codes; Information Theory; List Decoding; Insertion and Deletion Errors
• Online Access: https://hdl.handle.net/10356/169889
• Institution: Nanyang Technological University

For codes equipped with metrics such as Hamming metric, symbol pair metric or cover metric, the Johnson bound guarantees list-decodability of such codes. That is, the Johnson bound provides a lower bound on the list-decoding radius of a code in terms of its relative minimum distance, list size and t...