Zihan Zhang

Orcid: 0000-0001-5393-514X

Affiliations:
  • Ohio State University, Columbus, Ohio, USA


According to our database1, Zihan Zhang authored at least 11 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
AG Codes Achieve List-Decoding Capacity Over Constant-Sized Fields.
IEEE Trans. Inf. Theory, August, 2025

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors.
CoRR, April, 2025

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio.
Proceedings of the Approximation, 2025

2024
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bound.
CoRR, 2024

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
A new metric on symmetric groups and applications to block permutation codes.
Des. Codes Cryptogr., 2023

AG codes achieve list decoding capacity over contant-sized fields.
CoRR, 2023

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021
A New Metric on Symmetric Group and Application to Block Permutation Codes.
CoRR, 2021


  Loading...