A New Metric on Symmetric Group and Application to Block Permutation Codes. - Chaoping Xing; Zihan Zhang 001 (CoRR, 2021)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. - Zeyu Guo 001; Zihan Zhang 001 (FOCS, 2023)

AG codes achieve list decoding capacity over contant-sized fields. - Joshua Brakensiek; Manik Dhar; Sivakanth Gopi; Zihan Zhang 001 (CoRR, 2023)

A new metric on symmetric groups and applications to block permutation codes. - Zihan Zhang 001 (Des. Codes Cryptogr., 2023)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. - Zeyu Guo 001; Chaoping Xing; Chen Yuan 003; Zihan Zhang 001 (FOCS, 2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bound. - Yeyuan Chen; Zihan Zhang 001 (CoRR, 2024)

Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. - Zeyu Guo 001; Chaoping Xing; Chen Yuan 003; Zihan Zhang 001 (APPROX/RANDOM, 2025)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. - Roni Con; Zeyu Guo 001; Ray Li; Zihan Zhang 001 (ICALP, 2025)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. - Yeyuan Chen; Zihan Zhang 001 (STOC, 2025)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors. - Joshua Brakensiek; Yeyuan Chen; Manik Dhar; Zihan Zhang 001 (CoRR, 2025)

AG Codes Achieve List-Decoding Capacity Over Constant-Sized Fields. - Joshua Brakensiek; Manik Dhar; Sivakanth Gopi; Zihan Zhang 001 (IEEE Trans. Inf. Theory, 2025)