Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels

Authors Ronen Shaltiel, Jad Silbak

Thumbnail PDF


  • Filesize: 0.7 MB
  • 38 pages

Document Identifiers

Author Details

Ronen Shaltiel
Jad Silbak

Cite AsGet BibTex

Ronen Shaltiel and Jad Silbak. Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 45:1-45:38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


A stochastic code is a pair of encoding and decoding procedures where Encoding procedure receives a k bit message m, and a d bit uniform string S. The code is (p,L)-list-decodable against a class C of "channel functions" from n bits to n bits, if for every message m and every channel C in C that induces at most $pn$ errors, applying decoding on the "received word" C(Enc(m,S)) produces a list of at most L messages that contain m with high probability (over the choice of uniform S). Note that both the channel C and the decoding algorithm Dec do not receive the random variable S. The rate of a code is the ratio between the message length and the encoding length, and a code is explicit if Enc, Dec run in time poly(n). Guruswami and Smith (J. ACM, to appear), showed that for every constants 0 < p < 1/2 and c>1 there are Monte-Carlo explicit constructions of stochastic codes with rate R >= 1-H(p)-epsilon that are (p,L=poly(1/epsilon))-list decodable for size n^c channels. Monte-Carlo, means that the encoding and decoding need to share a public uniformly chosen poly(n^c) bit string Y, and the constructed stochastic code is (p,L)-list decodable with high probability over the choice of Y. Guruswami and Smith pose an open problem to give fully explicit (that is not Monte-Carlo) explicit codes with the same parameters, under hardness assumptions. In this paper we resolve this open problem, using a minimal assumption: the existence of poly-time computable pseudorandom generators for small circuits, which follows from standard complexity assumptions by Impagliazzo and Wigderson (STOC 97). Guruswami and Smith also asked to give a fully explicit unconditional constructions with the same parameters against O(log n)-space online channels. (These are channels that have space O(log n) and are allowed to read the input codeword in one pass). We resolve this open problem. Finally, we consider a tighter notion of explicitness, in which the running time of encoding and list-decoding algorithms does not increase, when increasing the complexity of the channel. We give explicit constructions (with rate approaching 1-H(p) for every p <= p_0 for some p_0>0) for channels that are circuits of size 2^{n^{Omega(1/d)}} and depth d. Here, the running time of encoding and decoding is a fixed polynomial (that does not depend on d). Our approach builds on the machinery developed by Guruswami and Smith, replacing some probabilistic arguments with explicit constructions. We also present a simplified and general approach that makes the reductions in the proof more efficient, so that we can handle weak classes of channels.
  • Error Correcting Codes
  • List Decoding
  • Pseudorandomness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Miklós Ajtai. Σ^1_1-formulae on finite structures. Ann. Pure Appl. Logic, 24(1):1-48, 1983. Google Scholar
  2. M. Braverman. Polylogarithmic independence fools ac^0 circuits. J. ACM, 57(5), 2010. URL: http://dx.doi.org/10.1145/1754399.1754401.
  3. A. Garcia and H. Stichtenoth. On the asymptotic behavior of some towers of function fields over finite fields. Journal of Number Theory, 61(2):248-273, 1996. Google Scholar
  4. Oded Goldreich. A sample of samplers - a computational perspective on sampling (survey). Electronic Colloquium on Computational Complexity (ECCC), 4(20), 1997. Google Scholar
  5. V. Guruswami and M. Sudan. Improved decoding of reed-solomon and algebraic-geometry codes. IEEE Transactions on Information Theory, 45(6):1757-1767, 1999. Google Scholar
  6. Venkatesan Guruswami and Adam D. Smith. Codes for computationally simple channels: Explicit constructions with optimal rate. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pages 723-732, 2010. URL: http://dx.doi.org/10.1109/FOCS.2010.74.
  7. R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In Proceedings of the ACM Symposium on Theory of Computing, pages 356-364, 1994. URL: http://dx.doi.org/10.1145/195058.195190.
  8. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In STOC, pages 220-229, 1997. Google Scholar
  9. E. Kaplan, M. Naor, and O. Reingold. Derandomized constructions of k-wise (almost) independent permutations. Algorithmica, 55(1):113-133, 2009. URL: http://dx.doi.org/10.1007/s00453-008-9267-y.
  10. Michael Langberg. Private codes or succinct random codes that are (almost) perfect. In 45th Symposium on Foundations of Computer Science (FOCS 2004), pages 325-334, 2004. URL: http://dx.doi.org/10.1109/FOCS.2004.51.
  11. Richard J. Lipton. A new approach to information theory. In 11th Annual Symposium on Theoretical Aspects of Computer Science, pages 699-708, 1994. URL: http://dx.doi.org/10.1007/3-540-57785-8_183.
  12. Silvio Micali, Chris Peikert, Madhu Sudan, and David A. Wilson. Optimal error correction for computationally bounded noise. IEEE Trans. Information Theory, 56(11):5673-5680, 2010. URL: http://dx.doi.org/10.1109/TIT.2010.2070370.
  13. N. Nisan. Pseudorandom bits for constant depth circuits. Combinatorica, 11(1):63-70, 1991. Google Scholar
  14. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992. Google Scholar
  15. N. Nisan and A. Wigderson. Hardness vs. randomness. JCSS: Journal of Computer and System Sciences, 49, 1994. Google Scholar
  16. N. Nisan and D. Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43-52, 1996. Google Scholar
  17. Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8(2):223-250, 1995. URL: http://dx.doi.org/10.1137/S089548019223872X.
  18. Amir Shpilka. Constructions of low-degree and error-correcting epsilon-biased generators. Computational Complexity, 18(4):495-525, 2009. URL: http://dx.doi.org/10.1007/s00037-009-0281-5.
  19. Adam D. Smith. Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 395-404, 2007. URL: http://dl.acm.org/citation.cfm?id=1283383.1283425.
  20. M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity, 13, 1997. Google Scholar
  21. Avishay Tal. Tight bounds on the fourier spectrum of ac^0. Electronic Colloquium on Computational Complexity (ECCC), 21:174, 2014. URL: http://eccc.hpi-web.de/report/2014/174.
  22. Luca Trevisan and Tongke Xue. A derandomized switching lemma and an improved derandomization of AC0. In Proceedings of the 28th Conference on Computational Complexity, CCC, pages 242-247, 2013. URL: http://dx.doi.org/10.1109/CCC.2013.32.
  23. Salil P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptology, 17(1):43-77, 2004. URL: http://dx.doi.org/10.1007/s00145-003-0237-x.
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail