Optimal Rate Code Constructions for Computationally Simple Channels
From MaRDI portal
Publication:3177812
DOI10.1145/2936015zbMath1407.94009arXiv1004.4017OpenAlexW2963279554MaRDI QIDQ3177812
No author found.
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.4017
Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items (6)
A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Disjoint difference families and their applications ⋮ An operational characterization of mutual information in algorithmic information theory ⋮ Unnamed Item ⋮ Explicit list-decodable codes with optimal rate for computationally bounded channels
This page was built for publication: Optimal Rate Code Constructions for Computationally Simple Channels