default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCan Xiang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Can Xiang, Chunming Tang
, Haode Yan, Min Guo:
Codes and pseudo-geometric designs from the ternary m-sequences with Welch-type decimation d = 2 ⋅ 3(n-1)/2 + 1. Finite Fields Their Appl. 94: 102341 (2024)- [c2]Jing Yang, Shu-Tao Xia, Xianfang Wang, Can Xiang, Fang-Wei Fu:
A New Multi-Receiver Authentication Scheme for General Access Structure. ISIT 2024: 3486-3491 - [c1]Min Jin, Can Xiang, Dong Xiang:
A Fast Method for Constructing Phase Shifters to Reduce Wiring Conflicts. ITC-Asia 2024: 1-6 - 2023
- [j26]Xin Ling, Can Xiang:
Infinite families of t-designs from the binomial x4+x3 over $\mathrm {GF}(2^n)$. Appl. Algebra Eng. Commun. Comput. 34(3): 411-421 (2023) - [j25]Can Xiang, Jinquan Luo:
Some subfield codes from MDS codes. Adv. Math. Commun. 17(4): 815-827 (2023) - [j24]Wenjuan Yin, Can Xiang, Fang-Wei Fu:
New frequency-hopping sequence sets with good parameters under aperiodic hamming correlation. Cryptogr. Commun. 15(1): 159-169 (2023) - [j23]Can Xiang, Chunming Tang:
Some 3-designs and shortened codes from binary cyclic codes with three zeros. Finite Fields Their Appl. 89: 102201 (2023) - [i13]Can Xiang, Chunming Tang, Haode Yan, Min Guo:
Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3(n-1)/2+1. CoRR abs/2306.10744 (2023) - 2022
- [j22]Wenjuan Yin, Can Xiang, Fang-Wei Fu:
Two constructions of low-hit-zone frequency-hopping sequence sets. Adv. Math. Commun. 16(2): 249-267 (2022) - [j21]Can Xiang, Chunming Tang, Min Guo:
Some shortened codes from linear codes constructed by defining sets. Adv. Math. Commun. 16(4): 1059-1069 (2022) - [j20]Can Xiang:
Some t-designs from BCH codes. Cryptogr. Commun. 14(3): 641-652 (2022) - [j19]Can Xiang, Chunming Tang, Qi Liu:
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). Des. Codes Cryptogr. 90(6): 1319-1333 (2022) - [j18]Can Xiang, Chunming Tang, Cunsheng Ding:
Shortened Linear Codes From APN and PN Functions. IEEE Trans. Inf. Theory 68(6): 3780-3795 (2022) - [i12]Can Xiang, Chunming Tang:
Some 3-designs and shortened codes from binary cyclic codes with three zeros. CoRR abs/2206.15153 (2022) - 2021
- [j17]Can Xiang, Wenjuan Yin:
Two families of subfield codes with a few weights. Cryptogr. Commun. 13(1): 117-127 (2021) - [i11]Can Xiang, Chunming Tang, Qi Liu:
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). CoRR abs/2110.03881 (2021) - 2020
- [j16]Can Xiang, Xin Ling, Qi Wang:
Combinatorial t-designs from quadratic functions. Des. Codes Cryptogr. 88(3): 553-565 (2020) - [j15]Can Xiang, Zongxiang Yi, Fang-Wei Fu, Wenjuan Yin:
New Constructions of Near-Complete External Difference Families Over Galois Rings. IEEE Commun. Lett. 24(5): 995-999 (2020) - [i10]Can Xiang, Chunming Tang, Cunsheng Ding:
Shortened linear codes from APN and PN functions. CoRR abs/2007.05923 (2020)
2010 – 2019
- 2019
- [j14]Wenjuan Yin, Can Xiang, Fang-Wei Fu:
A further construction of asymptotically optimal codebooks with multiplicative characters. Appl. Algebra Eng. Commun. Comput. 30(6): 453-469 (2019) - [i9]Can Xiang, Xin Ling, Qi Wang:
Combinatorial t-designs from quadratic functions. CoRR abs/1907.06235 (2019) - 2018
- [j13]Can Xiang, Xianfang Wang, Chunming Tang, Fang-Wei Fu:
Two classes of linear codes and their weight distributions. Appl. Algebra Eng. Commun. Comput. 29(3): 209-225 (2018) - [j12]Zengpeng Li, Can Xiang, Chengyu Wang:
Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography. Wirel. Commun. Mob. Comput. 2018: 5973285:1-5973285:11 (2018) - 2017
- [j11]Can Xiang, Chunming Tang, Keqin Feng:
A class of linear codes with a few weights. Cryptogr. Commun. 9(1): 93-116 (2017) - [j10]Xianfang Wang, Can Xiang, Fang-Wei Fu:
Secret sharing schemes for compartmented access structures. Cryptogr. Commun. 9(5): 625-635 (2017) - [j9]Chunming Tang, Can Xiang, Keqin Feng:
Linear codes with few weights from inhomogeneous quadratic functions. Des. Codes Cryptogr. 83(3): 691-714 (2017) - [j8]Can Xiang, Keqin Feng, Chunming Tang:
A Construction of Linear Codes Over 𝔽2t From Boolean Functions. IEEE Trans. Inf. Theory 63(1): 169-176 (2017) - [j7]Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng:
Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions. IEEE Trans. Inf. Theory 63(7): 4668-4674 (2017) - 2016
- [j6]Can Xiang:
Linear codes from a generic construction. Cryptogr. Commun. 8(4): 525-539 (2016) - [j5]Can Xiang, Chunming Tang:
New verifiable outsourced computation scheme for an arbitrary function. Int. J. Grid Util. Comput. 7(3): 190-199 (2016) - [j4]Can Xiang, Chunming Tang, Yunlu Cai, Qiuxia Xu:
Privacy-preserving face recognition with outsourced computation. Soft Comput. 20(9): 3735-3744 (2016) - [i8]Chunming Tang, Can Xiang, Keqin Feng:
Linear codes with a few weights from inhomogeneous quadratic functions. CoRR abs/1602.01511 (2016) - [i7]Can Xiang:
It is indeed a fundamental construction of all linear codes. CoRR abs/1610.06355 (2016) - [i6]Can Xiang:
Another q-Polynomial Approach to Cyclic Codes. CoRR abs/1610.06357 (2016) - [i5]Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng:
Complete characterization of generalized bent and 2^k-bent Boolean functions. IACR Cryptol. ePrint Arch. 2016: 335 (2016) - 2015
- [j3]Can Xiang, Chunming Tang:
Securely verifiable outsourcing schemes of matrix calculation. Int. J. High Perform. Comput. Netw. 8(2): 93-101 (2015) - [j2]Can Xiang, Chunming Tang:
Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. J. Ambient Intell. Humaniz. Comput. 6(1): 131-139 (2015) - [j1]Can Xiang, Cunsheng Ding, Sihem Mesnager:
Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound. IEEE Trans. Inf. Theory 61(12): 6526-6535 (2015) - [i4]Can Xiang:
A Family of Three-Weight Binary Linear Codes. CoRR abs/1505.07726 (2015) - [i3]Can Xiang, Keqin Feng, Chunming Tang:
A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions. CoRR abs/1511.02264 (2015) - [i2]Can Xiang, Chunming Tang, Keqin Feng:
A Class of Linear Codes with a Few Weights. CoRR abs/1512.07103 (2015) - 2014
- [i1]Can Xiang, Chunming Tang:
Privacy-Preserving Face Recognition with Outsourced Computation. IACR Cryptol. ePrint Arch. 2014: 969 (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 20:45 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:
