default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZihan Zhang 0001
Person information
- affiliation: Ohio State University, Columbus, Ohio, USA
Other persons with the same name
- Zihan Zhang — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j2]Joshua Brakensiek
, Manik Dhar, Sivakanth Gopi, Zihan Zhang:
AG Codes Achieve List-Decoding Capacity Over Constant-Sized Fields. IEEE Trans. Inf. Theory 71(8): 5935-5956 (2025)- [c6]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. APPROX/RANDOM 2025: 43:1-43:20 - [c5]Roni Con, Zeyu Guo, Ray Li, Zihan Zhang:
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. ICALP 2025: 60:1-60:21 - [c4]Yeyuan Chen, Zihan Zhang:
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. STOC 2025: 1-12 - [i9]Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang:
Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors. CoRR abs/2504.10399 (2025) - [i8]Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang:
Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. CoRR abs/2510.13775 (2025) - [i7]Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang:
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids. CoRR abs/2510.13777 (2025) - [i6]Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang:
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids. Electron. Colloquium Comput. Complex. TR25 (2025) - 2024
- [c3]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. FOCS 2024: 1846-1873 - [c2]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang:
AG Codes Achieve List Decoding Capacity over Constant-Sized Fields. STOC 2024: 740-751 - [i5]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR abs/2404.13230 (2024) - [i4]Roni Con, Zeyu Guo, Ray Li, Zihan Zhang:
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR abs/2407.07299 (2024) - [i3]Yeyuan Chen, Zihan Zhang:
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bound. CoRR abs/2408.15925 (2024) - 2023
- [j1]Zihan Zhang:
A new metric on symmetric groups and applications to block permutation codes. Des. Codes Cryptogr. 91(6): 2255-2271 (2023) - [c1]Zeyu Guo, Zihan Zhang:
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. FOCS 2023: 164-176 - [i2]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang:
AG codes achieve list decoding capacity over contant-sized fields. CoRR abs/2310.12898 (2023) - 2021
- [i1]Chaoping Xing, Zihan Zhang:
A New Metric on Symmetric Group and Application to Block Permutation Codes. CoRR abs/2103.05204 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-01 23:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
