Can Xiang

Orcid: 0000-0003-1929-9658

According to our database1, Can Xiang authored at least 35 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Codes and pseudo-geometric designs from the ternary <i>m</i>-sequences with Welch-type decimation <i>d</i> = 2 ⋅ 3<sup>(<i>n</i>-1)/2</sup> + 1.
Finite Fields Their Appl., February, 2024

2023
Infinite families of t-designs from the binomial x<sup>4</sup>+x<sup>3</sup> over $\mathrm {GF}(2^n)$.
Appl. Algebra Eng. Commun. Comput., May, 2023

Some 3-designs and shortened codes from binary cyclic codes with three zeros.
Finite Fields Their Appl., 2023

Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3<sup>(n-1)/2</sup>+1.
CoRR, 2023

New frequency-hopping sequence sets with good parameters under aperiodic hamming correlation.
Cryptogr. Commun., 2023

Some subfield codes from MDS codes.
Adv. Math. Commun., 2023

2022
Shortened Linear Codes From APN and PN Functions.
IEEE Trans. Inf. Theory, 2022

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7<sup>m+1)</sup>.
Des. Codes Cryptogr., 2022

Some t-designs from BCH codes.
Cryptogr. Commun., 2022

Two constructions of low-hit-zone frequency-hopping sequence sets.
Adv. Math. Commun., 2022

Some shortened codes from linear codes constructed by defining sets.
Adv. Math. Commun., 2022

2021
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7<sup>m</sup>+1).
CoRR, 2021

Two families of subfield codes with a few weights.
Cryptogr. Commun., 2021

2020
New Constructions of Near-Complete External Difference Families Over Galois Rings.
IEEE Commun. Lett., 2020

Combinatorial t-designs from quadratic functions.
Des. Codes Cryptogr., 2020

2019
A further construction of asymptotically optimal codebooks with multiplicative characters.
Appl. Algebra Eng. Commun. Comput., 2019

2018
Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography.
Wirel. Commun. Mob. Comput., 2018

Two classes of linear codes and their weight distributions.
Appl. Algebra Eng. Commun. Comput., 2018

2017
A Construction of Linear Codes Over 𝔽<sub>2<sup>t</sup></sub> From Boolean Functions.
IEEE Trans. Inf. Theory, 2017

Complete Characterization of Generalized Bent and 2<sup>k</sup>-Bent Boolean Functions.
IEEE Trans. Inf. Theory, 2017

Linear codes with few weights from inhomogeneous quadratic functions.
Des. Codes Cryptogr., 2017

A class of linear codes with a few weights.
Cryptogr. Commun., 2017

Secret sharing schemes for compartmented access structures.
Cryptogr. Commun., 2017

2016
Privacy-preserving face recognition with outsourced computation.
Soft Comput., 2016

New verifiable outsourced computation scheme for an arbitrary function.
Int. J. Grid Util. Comput., 2016

Complete characterization of generalized bent and 2^k-bent Boolean functions.
IACR Cryptol. ePrint Arch., 2016

Another q-Polynomial Approach to Cyclic Codes.
CoRR, 2016

It is indeed a fundamental construction of all linear codes.
CoRR, 2016

Linear codes from a generic construction.
Cryptogr. Commun., 2016

2015
Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.
IEEE Trans. Inf. Theory, 2015

Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server.
J. Ambient Intell. Humaniz. Comput., 2015

Securely verifiable outsourcing schemes of matrix calculation.
Int. J. High Perform. Comput. Netw., 2015

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

A Family of Three-Weight Binary Linear Codes.
CoRR, 2015

2014
Privacy-Preserving Face Recognition with Outsourced Computation.
IACR Cryptol. ePrint Arch., 2014


  Loading...