A Lower Bound on the List-Decodability of Insdel Codes-Reference-Cited by-同舟云学术

A Lower Bound on the List-Decodability of Insdel Codes

Author:

Liu Shu¹^ORCID,Tjuawinata Ivan²^ORCID,Xing Chaoping³^ORCID

Affiliation:

1. National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu, China

2. Strategic Centre for Research on Privacy-Preserving Technologies and Systems, Nanyang Technological University, Jurong West, Singapore

3. School of Electronic Information and Electric Engineering, Shanghai Jiao Tong University, Shanghai, China

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

National Key Laboratory of Science and Technology on Communications

National Research Foundation, Singapore under its Strategic Capability Research Centres Funding Initiative, National Key R&D Program of China

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

Reference46 articles.

2. Reed Solomon codes against adversarial insertions and deletions;con;arXiv 2107 05699,2021

4. Bounds and constructions for insertion and deletion codes;liu;arXiv 2111 14026,2021

5. Binary codes capable of correcting deletions, insertions and reversals;levenshtein;Sov Phys -Dokl,1966