Efficiently List-Decodable Insertion and Deletion Codes via Concatenation

DOI10.1109/TIT.2021.3096154MaRDI QIDQ4958264zbMATH OpenOpenAlexFDO

Authors Shu Liu, Ivan Tjuawinata, Chaoping Xing

Publication date 7 September 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2021.3096154

zbMATH Keywords

list decodability of random insdel codesZyablov-type bound for insdel metric codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited in

(3)

• Better Binary List-Decodable Codes Via Multilevel Concatenation
• Insdel codes from subspace and rank-metric codes
• New dimension-independent upper bounds on linear insdel codes

This page was built for publication: Efficiently List-Decodable Insertion and Deletion Codes via Concatenation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958264)