default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShanding Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Shanding Xu
, Jiafu Mi:
New Constructions for Near-Optimal Sets of Frequency-Hopping Sequences via the Gaussian Periods in Finite Fields. IEEE Access 10: 18463-18469 (2022)- [j23]Shanding Xu, Longjiang Qu, Xiwang Cao:
Three classes of partitioned difference families and their optimal constant composition codes. Adv. Math. Commun. 16(3): 465-483 (2022) - [j22]Shanding Xu:
Optimal frequency-hopping sequences based on the decimated m-sequences. Cryptogr. Commun. 14(5): 983-998 (2022) - 2020
- [j21]Xiwang Cao, Xiang-Dong Hou, Jiafu Mi, Shanding Xu:
More permutation polynomials with Niho exponents which permute Fq2. Finite Fields Their Appl. 62: 101626 (2020) - [j20]Shanding Xu, Xiwang Cao, Jiafu Mi, Chunming Tang:
Simplified Bounds on FHSs Set and Its Strictly Optimal Construction. Int. J. Found. Comput. Sci. 31(4): 499-513 (2020)
2010 – 2019
- 2019
- [j19]Shanding Xu, Xiwang Cao, Guangkui Xu, Chunming Tang:
Two classes of optimal frequency-hopping sequences with new parameters. Appl. Algebra Eng. Commun. Comput. 30(1): 1-16 (2019) - [j18]Shanding Xu, Xiwang Cao, Jiafu Mi, Chunming Tang:
More cyclotomic constructions of optimal frequency-hopping sequences. Adv. Math. Commun. 13(3): 373-391 (2019) - [j17]Shanding Xu, Xiwang Cao, Jiafu Mi, Chunming Tang:
A new family of optimal FHS sets with composite lengths. Discret. Math. 342(5): 1446-1455 (2019) - [j16]Shanding Xu, Xiwang Cao, Jian Gao:
A Note on the Zero-Difference Balanced Functions with New Parameters. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(10): 1402-1405 (2019) - 2018
- [j15]Gaojun Luo, Xiwang Cao, Shanding Xu, Jiafu Mi:
Binary linear codes with two or three weights from niho exponents. Cryptogr. Commun. 10(2): 301-318 (2018) - [j14]Shanding Xu, Xiwang Cao, Guangkui Xu, Gaojun Luo:
Two classes of near-optimal frequency-hopping sequence sets with prime-power period. Cryptogr. Commun. 10(3): 437-454 (2018) - [j13]Gaojun Luo, Xiwang Cao, Guangkui Xu, Shanding Xu:
A new class of optimal linear codes with flexible parameters. Discret. Appl. Math. 237: 126-131 (2018) - [j12]Shanding Xu, Xiwang Cao, Guangkui Xu, Chunming Tang:
Optimal FHSs and DSSs via near zero-difference balanced functions. Discret. Appl. Math. 247: 433-447 (2018) - [j11]Guangkui Xu, Xiwang Cao, Shanding Xu, Jingshui Ping:
Complete weight enumerators of a class of linear codes with two weights. Discret. Math. 341(2): 525-535 (2018) - [j10]Shanding Xu, Xiwang Cao, Jian Gao, Chunming Tang:
A Kind of Disjoint Cyclic Perfect Mendelsohn Difference Family and Its Applications in Strictly Optimal FHSs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2338-2343 (2018) - 2017
- [j9]Guangkui Xu, Xiwang Cao, Shanding Xu:
Several classes of Boolean functions with few Walsh transform values. Appl. Algebra Eng. Commun. Comput. 28(2): 155-176 (2017) - [j8]Guangkui Xu, Xiwang Cao, Shanding Xu:
Two classes of p-ary bent functions and linear codes with three or four weights. Cryptogr. Commun. 9(1): 117-131 (2017) - [j7]Jiafu Mi, Xiwang Cao, Shanding Xu, Gaojun Luo:
Quantum codes from Hermitian dual-containing cyclic codes. Int. J. Comput. Math. Comput. Syst. Theory 2(3): 97-109 (2017) - [j6]Guangkui Xu, Xiwang Cao, Shanding Xu:
Several Classes of Quadratic Ternary Bent, Near-Bent and 2-Plateaued Functions. Int. J. Found. Comput. Sci. 28(1): 1-18 (2017) - [c2]Shanding Xu, Xiwang Cao, Chunming Tang:
A Method to Enlarge the Design Distance of BCH Codes and Some Classes of Infinite Optimal Cyclic Codes. Inscrypt 2017: 518-528 - [c1]Shanding Xu, Xiwang Cao, Chunming Tang:
A kind of disjoint cyclic perfect mendelsohn difference family and its applications in strictly optimal FHSs. IWSDA 2017: 79-83 - 2016
- [j5]Guangkui Xu, Xiwang Cao, Shanding Xu:
Several classes of polynomials with low differential uniformity over finite fields of odd characteristic. Appl. Algebra Eng. Commun. Comput. 27(2): 91-103 (2016) - [j4]Guangkui Xu, Xiwang Cao, Shanding Xu:
Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method. Cryptogr. Commun. 8(1): 155-171 (2016) - [j3]Guangkui Xu, Xiwang Cao, Shanding Xu:
Optimal p-ary cyclic codes with minimum distance four from monomials. Cryptogr. Commun. 8(4): 541-554 (2016) - [j2]Shanding Xu, Xiwang Cao, Guangkui Xu:
Recursive construction of optimal frequency-hopping sequence sets. IET Commun. 10(9): 1080-1086 (2016) - [j1]Shanding Xu, Xiwang Cao, Guangkui Xu:
Optimal Frequency-Hopping Sequence Sets Based on Cyclotomy. Int. J. Found. Comput. Sci. 27(4): 443-462 (2016) - 2015
- [i1]Guangkui Xu, Xiwang Cao, Shanding Xu:
Several new classes of Boolean functions with few Walsh transform values. CoRR abs/1506.04886 (2015)
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-04-25 05: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:
