Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity

DOI10.1145/3406325.3451048MaRDI QIDQ6065271zbMATH OpenOpenAlexFDO

Authors Ronen Shaltiel, Jad Silbak

Publication date 14 November 2023

Published in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3406325.3451048

zbMATH Keywords

error-correctingonline-space bounded channelsuniquely decodable codes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Non-malleable codes with optimal rate for poly-size circuits
• Binary codes for error detection and correction in a computationally bounded world
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity

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