3 papers
cs.IT2026
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
Zeyu Guo, Roshan Raj, Chong Shangguan +1
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs,…
cs.IT2025
Improved Decoding of Tanner Codes
Zhaienhe Zhou, Zeyu Guo
In this paper, we present improved decoding algorithms for expander-based Tanner codes. We begin by developing a randomized linear-time decoding algorithm that, under the condition…
cs.IT2024
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
Roni Con, Zeyu Guo, Ray Li +1
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - w…