default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhao Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Zhao Hu
, Yunge Xu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang:
New Constructions of Optimal Linear Codes From Simplicial Complexes. IEEE Trans. Inf. Theory 70(3): 1823-1835 (2024)- [i5]Bing Chen, Yunge Xu, Zhao Hu, Nian Li, Xiangyong Zeng:
Optimal linear codes with few weights from simplicial complexes. CoRR abs/2407.10074 (2024) - 2023
- [j6]Zhao Hu, Nian Li, Linjie Xu, Xiangyong Zeng, Xiaohu Tang:
The differential spectrum and boomerang spectrum of a class of locally-APN functions. Des. Codes Cryptogr. 91(5): 1695-1711 (2023) - [i4]Zhao Hu, Yunge Xu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang:
New constructions of optimal linear codes from simplicial complexes. CoRR abs/2305.07206 (2023) - 2022
- [j5]Lisha Wang, Nian Li, Linjie Xu, Zhao Hu, Xiangyong Zeng, Liujie Nie:
Several new classes of optimal ternary cyclic codes with minimum distance four. Adv. Math. Commun. 16(4): 1001-1010 (2022) - [j4]Nian Li, Zhao Hu, Maosheng Xiong, Xiangyong Zeng:
A note on "Cryptographically strong permutations from the butterfly structure". Des. Codes Cryptogr. 90(2): 265-276 (2022) - [j3]Zhao Hu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang:
A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields. IEEE Trans. Inf. Theory 68(7): 4408-4421 (2022) - [c4]Zhao Hu, Sanbo Pan:
Research on Modulation Strategy of T-type Three-level Inverter. AIIPCC 2022: 169-173 - [c3]Zhao Hu:
Modulation strategy based on midpoint potential control∗. EITCE 2022: 266-269 - [c2]Zhao Hu, Bing Chen, Nian Li, Xiangyong Zeng:
Two Classes of Optimal Few-Weight Codes Over 픽q+u픽q. WAIFI 2022: 208-220 - [i3]Zhao Hu, Nian Li, Linjie Xu, Xiangyong Zeng, Xiaohu Tang:
The differential spectrum and boomerang spectrum of a class of locally-APN functions. CoRR abs/2206.14613 (2022) - 2021
- [j2]Zhao Hu, Lisha Wang, Nian Li, Xiangyong Zeng:
Several classes of linear codes with few weights from the closed butterfly structure. Finite Fields Their Appl. 76: 101926 (2021) - [i2]Zhao Hu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang:
A subfield-based construction of optimal linear codes over finite fields. CoRR abs/2108.09428 (2021) - 2020
- [j1]Zhao Hu, Nian Li, Xiangyong Zeng:
New linear codes with few weights derived from Kloosterman sums. Finite Fields Their Appl. 62: 101608 (2020) - [i1]Nian Li, Zhao Hu, Maosheng Xiong, Xiangyong Zeng:
4-uniform BCT permutations from generalized butterfly structure. CoRR abs/2001.00464 (2020)
2010 – 2019
- 2012
- [c1]Zhao Hu, Yuesheng Zhu, Limin Ma:
An improved Kerberos protocol based on Diffie-Hellman-DSA key exchange. ICON 2012: 400-404
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-08-16 19:29 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:
