Can Xiang

According to our database, Can Xiang authored at least 37 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Codes and pseudo-geometric designs from the ternary <i>m</i>-sequences with Welch-type decimation <i>d</i> = 2 ⋅ 3^{(<i>n</i>-1)/2} + 1.

Can Xiang, Chunming Tang, Haode Yan, Min Guo

Finite Fields Their Appl., February, 2024

A Fast Method for Constructing Phase Shifters to Reduce Wiring Conflicts.

Min Jin, Can Xiang, Dong Xiang

Proceedings of the IEEE International Test Conference in Asia, 2024

A New Multi-Receiver Authentication Scheme for General Access Structure.

Jing Yang, Shu-Tao Xia, Xianfang Wang, Can Xiang, Fang-Wei Fu

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Infinite families of t-designs from the binomial x⁴+x³ over $\mathrm {GF}(2^n)$.

Xin Ling, Can Xiang

Appl. Algebra Eng. Commun. Comput., May, 2023

Some 3-designs and shortened codes from binary cyclic codes with three zeros.

Can Xiang, Chunming Tang

Finite Fields Their Appl., 2023

Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3^(n-1)/2+1.

Can Xiang, Chunming Tang, Haode Yan, Min Guo

CoRR, 2023

New frequency-hopping sequence sets with good parameters under aperiodic hamming correlation.

Wenjuan Yin, Can Xiang, Fang-Wei Fu

Cryptogr. Commun., 2023

Some subfield codes from MDS codes.

Can Xiang, Jinquan Luo

Adv. Math. Commun., 2023

2022

Shortened Linear Codes From APN and PN Functions.

Can Xiang, Chunming Tang, Cunsheng Ding

IEEE Trans. Inf. Theory, 2022

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7^m+1).

Can Xiang, Chunming Tang, Qi Liu

Des. Codes Cryptogr., 2022

Some t-designs from BCH codes.

Can Xiang

Cryptogr. Commun., 2022

Two constructions of low-hit-zone frequency-hopping sequence sets.

Wenjuan Yin, Can Xiang, Fang-Wei Fu

Adv. Math. Commun., 2022

Some shortened codes from linear codes constructed by defining sets.

Can Xiang, Chunming Tang, Min Guo

Adv. Math. Commun., 2022

2021

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7^m+1).

Can Xiang, Chunming Tang, Qi Liu

CoRR, 2021

Two families of subfield codes with a few weights.

Can Xiang, Wenjuan Yin

Cryptogr. Commun., 2021

2020

New Constructions of Near-Complete External Difference Families Over Galois Rings.

Can Xiang, Zongxiang Yi, Fang-Wei Fu, Wenjuan Yin

IEEE Commun. Lett., 2020

Combinatorial t-designs from quadratic functions.

Can Xiang, Xin Ling, Qi Wang

Des. Codes Cryptogr., 2020

2019

A further construction of asymptotically optimal codebooks with multiplicative characters.

Wenjuan Yin, Can Xiang, Fang-Wei Fu

Appl. Algebra Eng. Commun. Comput., 2019

2018

Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography.

Zengpeng Li, Can Xiang, Chengyu Wang

Wirel. Commun. Mob. Comput., 2018

Two classes of linear codes and their weight distributions.

Can Xiang, Xianfang Wang, Chunming Tang, Fang-Wei Fu

Appl. Algebra Eng. Commun. Comput., 2018

2017

A Construction of Linear Codes Over 𝔽_2^t From Boolean Functions.

Can Xiang, Keqin Feng, Chunming Tang

IEEE Trans. Inf. Theory, 2017

Complete Characterization of Generalized Bent and 2^k-Bent Boolean Functions.

Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng

IEEE Trans. Inf. Theory, 2017

Linear codes with few weights from inhomogeneous quadratic functions.

Chunming Tang, Can Xiang, Keqin Feng

Des. Codes Cryptogr., 2017

A class of linear codes with a few weights.

Can Xiang, Chunming Tang, Keqin Feng

Cryptogr. Commun., 2017

Secret sharing schemes for compartmented access structures.

Xianfang Wang, Can Xiang, Fang-Wei Fu

Cryptogr. Commun., 2017

2016

Privacy-preserving face recognition with outsourced computation.

Can Xiang, Chunming Tang, Yunlu Cai, Qiuxia Xu

Soft Comput., 2016

New verifiable outsourced computation scheme for an arbitrary function.

Can Xiang, Chunming Tang

Int. J. Grid Util. Comput., 2016

Complete characterization of generalized bent and 2^k-bent Boolean functions.

Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng

IACR Cryptol. ePrint Arch., 2016

Another q-Polynomial Approach to Cyclic Codes.

Can Xiang

CoRR, 2016

It is indeed a fundamental construction of all linear codes.

Can Xiang

CoRR, 2016

Linear codes from a generic construction.

Can Xiang

Cryptogr. Commun., 2016

2015

Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.

Can Xiang, Cunsheng Ding, Sihem Mesnager

IEEE Trans. Inf. Theory, 2015

Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server.

Can Xiang, Chunming Tang

J. Ambient Intell. Humaniz. Comput., 2015

Securely verifiable outsourcing schemes of matrix calculation.

Can Xiang, Chunming Tang

Int. J. High Perform. Comput. Netw., 2015

A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions.

Can Xiang, Keqin Feng, Chunming Tang

CoRR, 2015

A Family of Three-Weight Binary Linear Codes.

Can Xiang

CoRR, 2015

2014

Privacy-Preserving Face Recognition with Outsourced Computation.

Can Xiang, Chunming Tang

IACR Cryptol. ePrint Arch., 2014