Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets

This collection of new arXiv submissions (math/information theory) covers advances in algebraic pseudorandomness (explicit lossless rank extractors, weak subspace designs, and strong s‑blocking sets via function fields and polynomial-identity-testing), information-theoretic limits and stability results (stability of the Shannon–McMillan–Breiman theorem under sublinear parsings; bounds for entropic optimal transport via a rate-distortion integral), and a range of applied communications and signal-processing topics (Age-of-Information optimization in half‑duplex distributed sensor networks; AoI/