Explicit, almost optimal, epsilon-balanced codes

DOI10.1145/3055399.3055408MaRDI QIDQ4977975zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

zig-zag productepsilon-biaswide replacement product

Mathematics Subject Classification ID

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

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)

• Optimal \(\varepsilon\)-biased sets with just a little randomness
• Constructing small-bias sets from algebraic-geometric codes
• Strong blocking sets and minimal codes from expander graphs
• On the ring-LWE and polynomial-LWE problems
• Paradigms for Unconditional Pseudorandom Generators
• 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
• scientific article; zbMATH DE number 3463503 (Why is no real title available?)
• Quasi-random multilinear polynomials
• Simple and efficient batch verification techniques for verifiable delay functions
• Non-malleable codes with optimal rate for poly-size circuits
• Constructing small-bias sets from algebraic-geometric codes
• 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

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)