Constructing small-bias sets from algebraic-geometric codes

DOI10.4086/TOC.2013.V009A005MaRDI QIDQ3191573zbMATH OpenOpenAlexFDO

Authors Avraham Ben-Aroya, Amnon Ta-Shma

Publication date 6 October 2014

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2013.v009a005

zbMATH Keywords

AG codesalgebraic geometryGoppa codessmall-bias sets

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Constructing small-bias sets from algebraic-geometric codes
• Explicit, almost optimal, epsilon-balanced codes
• Optimal -biased sets with just a little randomness
• Constructions of low-degree and error-correcting -biased generators
• A new method for constructing small-bias spaces from Hermitian codes

Cited in

(10)

• Efficient branching programs for quantum hash functions generated by small-biased sets
• Small-bias sets from extended norm-trace codes
• A new method for constructing small-bias spaces from Hermitian codes
• \texttt{Sample(x)=(a*x<=t)} is a distinguisher with probability \(1/8\)
• Small bias requires large formulas
• Pseudorandom functions: three decades later
• Constructing small-bias sets from algebraic-geometric codes
• When do low-rate concatenated codes approach the Gilbert-Varshamov bound?
• Optimal pseudorandom generators for low-degree polynomials over moderately large fields
• Fooling near-maximal decision trees

This page was built for publication: Constructing small-bias sets from algebraic-geometric codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191573)