Explicit algebraic constructions produce lossless rank extractors and strong s-blocking sets of size O(s(k-s)q^s) over non-prime fields q >= poly(s), matching best non-explicit bounds up to constants.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
Explicit algebraic constructions produce lossless rank extractors and strong s-blocking sets of size O(s(k-s)q^s) over non-prime fields q >= poly(s), matching best non-explicit bounds up to constants.