Explicit, almost optimal, epsilon-balanced codes
From MaRDI portal
Publication:4977975
DOI10.1145/3055399.3055408zbMATH Open1378.94079OpenAlexW2625993870WikidataQ62398442 ScholiaQ62398442MaRDI QIDQ4977975FDOQ4977975
Authors: 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
Recommendations
- Efficient \(m\)-ary balanced codes
- On error-correcting balanced codes
- scientific article; zbMATH DE number 3463503
- Error-Correcting Balanced Knuth Codes
- Efficient balanced codes
- On balanced codes
- Design of efficient balanced codes
- \(e\)-perfect codes
- On efficient balanced codes over the mth roots of unity
- On optimal binary codes with unbalanced coordinates
Cited In (22)
- Constructing small-bias sets from algebraic-geometric codes
- Strong blocking sets and minimal codes from expander graphs
- Paradigms for Unconditional Pseudorandom Generators
- On the ring-LWE and polynomial-LWE problems
- List-Decoding with Double Samplers
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates
- Title not available (Why is that?)
- Quasi-random multilinear polynomials
- Non-malleable codes with optimal rate for poly-size circuits
- Constructing small-bias sets from algebraic-geometric codes
- Simple and efficient batch verification techniques for verifiable delay functions
- Expanding Generating Sets for Solvable Permutation Groups
- Pseudorandom error-correcting codes
- Traceable secret sharing: strong security and efficient constructions
- A high dimensional Goldreich-Levin theorem
- Random walks on rotating expanders
- The remote point problem, small bias spaces, and expanding generator sets
- Essential components in vector spaces over finite fields
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs
- Nearly optimal pseudorandomness from hardness
- Optimal \(\varepsilon\)-biased sets with just a little randomness
This page was built for publication: Explicit, almost optimal, epsilon-balanced codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977975)
