Constructing Small-Bias Sets from Algebraic-Geometric Codes

DOI10.1109/FOCS.2009.44zbMath1292.94182OpenAlexW2113856218WikidataQ29013128 ScholiaQ29013128MaRDI QIDQ5171175

Avraham Ben-Aroya, Amnon Ta-Shma

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2009.44

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Quantum hashing for finite abelian groups ⋮ Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations ⋮ Derandomizing restricted isometries via the Legendre symbol ⋮ Binary quantum hashing ⋮ Improved constructions for non-adaptive threshold group testing ⋮ On rigid matrices and \(U\)-polynomials ⋮ Explicit constructions of RIP matrices and related problems ⋮ Special divisors of large dimension on curves with many points over finite fields ⋮ Optimal $\varepsilon$-Biased Sets with Just a Little Randomness ⋮ Analysis of properties of quantum hashing

This page was built for publication: Constructing Small-Bias Sets from Algebraic-Geometric Codes