2 citations · 3 across the 4 of their papers we have counts for
5 papers
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,…
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…
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…
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
Zeyu Guo, Chaoping Xing, Chen Yuan +1
Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful posi…
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…