default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDongchun Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Dongchun Han, Hanbin Zhang:
Explicit constructions of NMDS self-dual codes. Des. Codes Cryptogr. 92(11): 3573-3585 (2024)- [j14]Li Xu, Cuiling Fan, Dongchun Han
:
Near-MDS codes from maximal arcs in PG(2,q). Finite Fields Their Appl. 93: 102338 (2024) - 2023
- [j13]Yuan Ren, Dongchun Han:
On MDS geometric Fq-linear Fqt-codes. Discret. Math. 346(1): 113125 (2023) - [j12]Dongchun Han, Yuan Ren:
A Tight Upper Bound for the Maximal Length of MDS Elliptic Codes. IEEE Trans. Inf. Theory 69(2): 819-822 (2023) - [j11]Dongchun Han, Cuiling Fan:
Roth-Lempel NMDS Codes of Non-Elliptic-Curve Type. IEEE Trans. Inf. Theory 69(9): 5670-5675 (2023) - 2022
- [j10]Zhen Li, Haode Yan, Dongchun Han:
A class of power functions with four-valued Walsh transform and related cyclic codes. Finite Fields Their Appl. 83: 102078 (2022) - [j9]Yuan Ren, Dongchun Han:
On equivalent classes of minimal Abelian codes. J. Comb. Theory A 189: 105616 (2022) - [i2]Li Xu, Cuiling Fan, Dongchun Han:
Near-MDS Codes from Maximal Arcs in PG$(2, q)$. CoRR abs/2208.08578 (2022) - 2021
- [j8]Dongchun Han, Hanbin Zhang:
On ⁎-clean group rings over finite fields. Finite Fields Their Appl. 73: 101863 (2021) - [j7]Dongchun Han, Hanbin Zhang:
A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences. SIAM J. Discret. Math. 35(2): 1077-1095 (2021) - 2020
- [j6]Dongchun Han:
A note on character sums in function fields. Finite Fields Their Appl. 68: 101734 (2020)
2010 – 2019
- 2019
- [j5]Dongchun Han, Hanbin Zhang:
On generalized Erdős-Ginzburg-Ziv constants of Cnr. Discret. Math. 342(4): 1117-1127 (2019) - [j4]Dongchun Han, Hanbin Zhang:
Zero-sum invariants on finite abelian groups with large exponent. Discret. Math. 342(12) (2019) - [j3]Dongchun Han, Haode Yan:
On an open problem about a class of optimal ternary cyclic codes. Finite Fields Their Appl. 59: 335-343 (2019) - [j2]Haode Yan, Dongchun Han:
New Ternary Power Mapping with Differential Uniformity Δf≤3 and Related Optimal Cyclic Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(6): 849-853 (2019) - [i1]Dongchun Han, Haode Yan:
On an open problem about a class of optimal ternary cyclic codes. CoRR abs/1901.08230 (2019) - 2014
- [j1]Weidong Gao, Dongchun Han, Jiangtao Peng, Fang Sun:
On zero-sum subsequences of length kexp(G). J. Comb. Theory A 125: 240-253 (2014)
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 2024-10-15 21:38 CEST 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:
