Optimally Resilient Codes for List-Decoding From Insertions and Deletions

DOI10.1109/TIT.2021.3120910MaRDI QIDQ5032623zbMATH OpenOpenAlexFDO

Authors Bernhard Haeupler, Amirbehshad Shahrasbi, Venkatesan Guruswami

Publication date 17 February 2022

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

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

zbMATH Keywords

concatenation schemelist-decodable insertion-deletion codes

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Cited in

(1)

• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes

This page was built for publication: Optimally Resilient Codes for List-Decoding From Insertions and Deletions

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