3 papers
cs.IT2026
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.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
Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
Omar Alrabiah, Zeyu Guo, Venkatesan Guruswami +2
Reed-Solomon codes are a classic family of error-correcting codes consisting of evaluations of low-degree polynomials over a finite field on some sequence of distinct field element…