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

Abstract

A stochastic code is a pair of encoding and decoding procedures (Enc, Dec) where \({{\rm Enc} : \{0, 1\}^{k} \times \{0, 1\}^{d} \rightarrow \{0, 1\}^{n}}\). The code is (p, L)-list decodable against a class \(\mathcal{C}\) of “channel functions” \(C : \{0,1\}^{n} \rightarrow \{0,1\}^{n}\) if for every message \(m \in \{0,1\}^{k}\) and every channel \(C \in \mathcal{C}\) that induces at most pn errors, applying Dec 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 \leftarrow \{0, 1\}^{d}\). Note that both the channel C and the decoding algorithm Dec do not receive the random variable S, when attempting to decode. The rate of a code is \(R = k/n\), and a code is explicit if Enc, Dec run in time poly(n).

Guruswami and Smith (Journal of the ACM, 2016) showed that for every constants \(0 < p < \frac{1}{2}, \epsilon > 0\) and \(c > 1\) there exist a constant L and a Monte Carlo explicit constructions of stochastic codes with rate \(R \geq 1-H(p) - \epsilon\) that are (p, L)-list decodable for size \(n^c\) channels. Here, Monte Carlo means that the encoding and decoding need to share a public uniformly chosen \({\rm 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 also 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 \leq 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 polynomial that does not depend on the depth of the circuit.

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.

This is a preview of subscription content, access via your institution.

References

  1. Miklós Ajtai (1983). \(\Sigma ^{1}_{1}\)-formulae on finite structures. Ann. Pure Appl. Logic 24(1), 1–48. ISSN 0168-0072

  2. Braverman, M.: Polylogarithmic independence fools AC\(^{\text{0}}\) circuits. J. ACM 57(5), (2010)

  3. Zeev Dvir & Shachar Lovett (2012). Subspace Evasive Sets. In Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC '12, 351–358. ACM, New York, NY, USA. ISBN 978-1-4503-1245-5. URL http://doi.acm.org/10.1145/2213977.2214010

  4. Garcia, A., Stichtenoth, H.: On the asymptotic behavior of some towers of function fields over finite fields. Journal of Number Theory 61(2), 248–273 (1996)

    MathSciNet  Article  Google Scholar 

  5. Goldreich, Oded: A Sample of Samplers - A Computational Perspective on Sampling (survey). Electronic Colloquium on Computational Complexity (ECCC) 4(20), (1997)

  6. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory 45(6), 1757–1767 (1999)

    MathSciNet  Article  Google Scholar 

  7. Guruswami, Venkatesan, Hastad, Johan, Sudan, Madhu, Zuckerman, David: Combinatorial bounds for list decoding. IEEE Transactions on Information Theory 48(5), 1021–1034 (2002)

    MathSciNet  Article  Google Scholar 

  8. Venkatesan Guruswami & Adam Smith: Optimal rate code constructions for computationally simple channels. Journal of the ACM (JACM) 63(4), 35 (2016)

    MathSciNet  MATH  Google Scholar 

  9. Venkatesan Guruswami & Carol Wang: Linear-algebraic list decoding for variants of Reed-Solomon codes. IEEE Transactions on Information Theory 59(6), 3257–3268 (2013)

    MathSciNet  Article  Google Scholar 

  10. Brett Hemenway & Mary Wootters (2015). Linear-time list recovery of high-rate expander codes. In International Colloquium on Automata, Languages, and Programming, 701–712. Springer

  11. R. Impagliazzo, N. Nisan & A. Wigderson (1994). Pseudorandomness for network algorithms. In Proceedings of the ACM Symposium on Theory of Computing, 356–364

  12. R. Impagliazzo & A. Wigderson (1997). \(\it P\it = \it BPP\it \) if \(E\) Requires Exponential Circuits: Derandomizing the XOR Lemma. In STOC, 220–229

  13. Kaplan, E., Naor, M., Reingold, O.: Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55(1), 113–133 (2009)

    MathSciNet  Article  Google Scholar 

  14. Swastik Kopparty, Ronen Shaltiel & Jad Silbak (2019). Quasilinear time list-decodable codes for space bounded channels. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science FOCS, volume 2019, 1–1

  15. Michael Langberg (2004). Private Codes or Succinct Random Codes That Are (Almost) Perfect. In 45th Symposium on Foundations of Computer Science (FOCS 2004), 325–334. URL http://dx.doi.org/10.1109/FOCS.2004.51

  16. Richard J. Lipton (1994). A New Approach To Information Theory. In 11th Annual Symposium on Theoretical Aspects of Computer Science, 699–708. URL http://dx.doi.org/10.1007/3-540-57785-8_183

  17. Silvio Micali, Chris Peikert, Madhu Sudan & David A. Wilson (2010). Optimal Error Correction for Computationally Bounded Noise. IEEE Trans. Information Theory 56(11), 5673–5680. URL http://dx.doi.org/10.1109/TIT.2010.2070370

  18. Nisan, N.: Pseudorandom bits for constant depth circuits. Combinatorica 11(1), 63–70 (1991)

    MathSciNet  Article  Google Scholar 

  19. Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449–461 (1992)

    MathSciNet  Article  Google Scholar 

  20. N. Nisan & A. Wigderson (1994). Hardness vs. Randomness. JCSS: Journal of Computer and System Sciences 49

  21. Nisan, N., Zuckerman, D.: Randomness is Linear in Space. J. Comput. Syst. Sci. 52(1), 43–52 (1996)

    MathSciNet  Article  Google Scholar 

  22. Jeanette P. Schmidt, Alan Siegel & Aravind Srinivasan (1995). Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discrete Math. 8(2), 223–250. URL http://dx.doi.org/10.1137/S089548019223872X

  23. Ronen Shaltiel & Jad Silbak (2020). Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity. Electronic Colloquium on Computational Complexity (ECCC) 27, 47. URL https://eccc.weizmann.ac.il/report/2020/047

  24. Shannon, Claude E.: A mathematical theory of communication. The Bell system technical journal 27(3), 379–423 (1948)

    MathSciNet  Article  Google Scholar 

  25. Amir Shpilka (2009). Constructions of Low-degree and Error-Correcting epsilon-Biased Generators. Computational Complexity 18(4), 495–525. URL http://dx.doi.org/10.1007/s00037-009-0281-5

  26. Adam D. Smith (2007). 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, 395–404. URL http://dl.acm.org/citation.cfm?id=1283383.1283425

  27. M. Sudan (1997). Decoding of Reed Solomon Codes Beyond the Error-Correction Bound. Journal of Complexity 13

  28. Avishay Tal (2014). Tight bounds on The Fourier Spectrum of AC\({}^{\text{0}}\). Electronic Colloquium on Computational Complexity (ECCC) 21, 174. URL http://eccc.hpi-web.de/report/2014/174

  29. Luca Trevisan & Tongke Xue (2013). A Derandomized Switching Lemma and an Improved Derandomization of AC0. In Proceedings of the 28th Conference on Computational Complexity, CCC, 242–247. URL http://dx.doi.org/10.1109/CCC.2013.32

  30. Salil P. Vadhan (2004). Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. J. Cryptology 17(1), 43–77. URL http://dx.doi.org/10.1007/s00145-003-0237-x

Download references

Acknowledgements

We are grateful to Swastik Kopparty for pointing us to the Algebraic Geometric codes of Garcia and Stichtenoth, and in particular for pointing us to their description in Shpilka (2009). We thank Noga Ron-Zewi for help with list-recoverable codes. We also thank the anonymous referees for helpful feedback.

Ronen Shaltiel was supported by ERC starting grant 279559, ISF grant 864/11, ISF grant 1628/17 and BSF grant 2010120. Jad Silbak was supported by ERC starting grant 279559 and ISF grant 1628/17.

We are grateful to anonymous referees for helpful comments and corrections.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Jad Silbak.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Shaltiel, R., Silbak, J. Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels . comput. complex. 30, 3 (2021). https://doi.org/10.1007/s00037-020-00203-w

Download citation

Keywords

  • error correcting codes
  • computationally bounded channels
  • pseudorandomness

Subject classification

  • 68Q01