Explicit, almost optimal, epsilon-balanced codes

DOI10.1145/3055399.3055408zbMath1378.94079OpenAlexW2625993870WikidataQ62398442 ScholiaQ62398442MaRDI QIDQ4977975

Amnon Ta-Shma

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3055399.3055408

zbMATH Keywords

zig-zag productepsilon-biaswide replacement product

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Random walks on graphs (05C81)

Related Items (8)

Quasi-random multilinear polynomials ⋮ Expanding Generating Sets for Solvable Permutation Groups ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Essential components in vector spaces over finite fields ⋮ Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates ⋮ List-Decoding with Double Samplers

This page was built for publication: Explicit, almost optimal, epsilon-balanced codes