Explicit, almost optimal, epsilon-balanced codes-Reference-Cited by-同舟云学术

Explicit, almost optimal, epsilon-balanced codes

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Ta-Shma Amnon¹

Affiliation:

1. Tel Aviv University, Israel

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055408

Reference32 articles.

1. Manindra Agrawal Neeraj Kayal and Nitin Saxena. 2004. PRIMES is in P. Annals of mathematics (2004) 781–793. Manindra Agrawal Neeraj Kayal and Nitin Saxena. 2004. PRIMES is in P. Annals of mathematics (2004) 781–793.

2. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs

3. Simple Constructions of Almost k-wise Independent Random Variables

4. N. Alon O. Schwartz and A. Shapira. 2007. N. Alon O. Schwartz and A. Shapira. 2007.

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs;Algorithmica;2024-07-29

2. Strong blocking sets and minimal codes from expander graphs;Transactions of the American Mathematical Society;2024-06-11

3. Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Linear Codes for Hyperdimensional Computing;Neural Computation;2024-05-10

5. Analyzing Ta-Shma’s Code via the Expander Mixing Lemma;IEEE Transactions on Information Theory;2024-02