Tongjiang Yan
Orcid: 0000-0002-9647-503X
According to our database1,
Tongjiang Yan
authored at least 87 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
CosPer: An adaptive personalized approach for enhancing fairness and robustness of federated learning.
Inf. Sci., 2024
Research on the Construction of Maximum Distance Separable Codes via Arbitrary twisted Generalized Reed-Solomon Codes.
CoRR, 2024
2023
FedCSR: A new cluster sampling based on rotation mechanism in horizontal federated learning.
Comput. Commun., October, 2023
Appl. Intell., May, 2023
New quantum stabilizer codes with better parameters from the images of some RS codes and BCH codes.
Quantum Inf. Process., January, 2023
Quantum Inf. Process., January, 2023
Robust Low-Rank Matrix Recovery as Mixed Integer Programming via $\ell _{0}$-Norm Optimization.
IEEE Signal Process. Lett., 2023
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2023
2022
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022
CoRR, 2022
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022
2021
Quantum Inf. Process., 2021
An Extension Method to Construct <i>M</i>-Ary Sequences of Period 4<i>N</i> with Low Autocorrelation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021
The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude.
Des. Codes Cryptogr., 2021
Quantum Synchronizable Codes From Cyclotomic Classes of Order Two over Z<sub>2q</sub>.
CoRR, 2021
A new upper bound and optimal constructions of equi-difference conflict-avoiding codes on constant weight.
CoRR, 2021
Further results on the 2-adic complexity of a class of balanced generalized cyclotomic sequences.
CoRR, 2021
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products.
Cryptogr. Commun., 2021
2020
Linear Complexity of Two Classes of Binary Interleaved Sequences with Low Autocorrelation.
Int. J. Netw. Secur., 2020
IEEE Commun. Lett., 2020
Hermitian dual-containing constacyclic BCH codes and related quantum codes of length (q<sup>2m</sup>-1)/(q+1).
CoRR, 2020
The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude.
CoRR, 2020
Complex., 2020
The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude.
Cryptogr. Commun., 2020
The 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Order 2 and Period pq.
IEEE Access, 2020
IEEE Access, 2020
Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-Ary m-Sequence.
IEEE Access, 2020
2019
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products.
CoRR, 2019
CoRR, 2019
Cryptogr. Commun., 2019
Construction of a Near-Optimal Quasi-Complementary Sequence Set from Almost Difference Set.
Cryptogr. Commun., 2019
Appl. Algebra Eng. Commun. Comput., 2019
2018
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude.
CoRR, 2018
Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N.
CoRR, 2018
The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation.
Cryptogr. Commun., 2018
2017
Int. J. Netw. Secur., 2017
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017
IEEE Commun. Lett., 2017
The 2-adic complexity of a class of binary sequences with almost optimal autocorrelation.
CoRR, 2017
A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period p<sup>n</sup>.
CoRR, 2017
Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-ary m-Sequence.
CoRR, 2017
Constructions of Optimal and Near-Optimal Quasi-Complementary Sequence Sets from an Almost Difference Set.
CoRR, 2017
A lower bound on the 2-adic complexity of Whiteman's generalized cyclotomic sequences of order 4 with length pq.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017
2016
Int. J. Netw. Secur., 2016
Adv. Math. Commun., 2016
2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
2014
A general construction of binary interleaved sequences of period 4N with optimal autocorrelation.
Inf. Sci., 2014
CoRR, 2014
2013
Divisible difference sets, relative difference sets and sequences with ideal autocorrelation.
Inf. Sci., 2013
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
Some Notes on the Generalized Cyclotomic Binary Sequences of Length 2<i>p<sup>m</sup></i> and <i>p<sup>m</sup></i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
Linear Complexity of a New Generalized Cyclotomic Sequence of Order Two of Length <i>pq</i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
Cyclic code from the first class Whiteman's generalized cyclotomic sequence with order 4
CoRR, 2013
The cross-correlation distribution of a p-ary m-sequence of period p<sup>2k</sup>-1 and its decimated sequence by ( (p<sup>k</sup>+1)<sup>2</sup> / 2(p<sup>e</sup>+1) ).
Adv. Math. Commun., 2013
Proceedings of the 2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013
Proceedings of the 2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013
Autocorrelation Values of New Generalized Cyclotomic Sequences of Order Six Over Z_pq.
Proceedings of the Information Security and Cryptology - 9th International Conference, 2013
2012
Computing the <i>k</i>-Error Linear Complexity of <i>q</i>-Ary Sequences with Period 2<i>p<sub>n</sub></i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012
2011
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
CoRR, 2011
$p$-ary sequences with six-valued cross-correlation function: a new decimation of Niho type
CoRR, 2011
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011
On the cross-correlation of a ternary m-sequence of period 3<sup>4k</sup> - 1 and its decimated sequence by (3<sup>2k</sup>+1)<sup>2</sup>/20.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011
2010
New Binary Sequences of Period <i>pq</i> with Low Values of Correlation and Large Linear Complexity.
Int. J. Netw. Secur., 2010
2009
Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2<sup>k</sup>.
Inf. Sci., 2009
Proceedings of the Fifth International Conference on Information Assurance and Security, 2009
2008
Cryptographic properties of some binary generalized cyclotomic sequences with the length p<sup>2</sup>.
Inf. Sci., 2008
Inf. Sci., 2008
Inf. Sci., 2008
Trace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences.
Int. J. Netw. Secur., 2008
On the linear complexity of generalized cyclotomic sequences with the period p<sup>m</sup>.
Appl. Math. Lett., 2008
2007
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007