Relaxed Locally Correctable Codes in Computationally Bounded Channels

DOI10.1109/TIT.2021.3076396zbMath1475.94205arXiv1803.05652OpenAlexW3159135841MaRDI QIDQ5001794

Elena Grigorescu, Jeremiah Blocki, Samson Zhou, Venkata Gandikota

Publication date: 23 July 2021

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

Full work available at URL: https://arxiv.org/abs/1803.05652

zbMATH Keywords

collision-resistant hash functionscomputationally bounded adversarial channelslocal expander graphslocally decodable and locally correctable codes

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (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: Relaxed Locally Correctable Codes in Computationally Bounded Channels