Tongjiang Yan

Yanli Wang, Yanxin Chen, Tongjiang Yan

This paper contributes to maximum distance separable (MDS) and near MDS (NMDS) properties of the extended generalized twisted Reed-Solomon (TGRS) codes. Firstly, a family of extended TGRS (ETGRS) are constructed by appending three columns to the generator matrix of original TGRS codes. Secondly, the necessary and sufficient conditions for these codes to be MDS or almost MDS (AMDS) codes are derived. Then, by analyzing the AMDS properties of their dual codes, the necessary and sufffcient conditions for them to be NMDS codes are established. Furthermore, some examples are given to verify the main results. Finally, we determine the non-generalized Reed-Solomon (non-GRS) characteristics of them via the Schur product method.

Yanxin Chen, Yanli Wang, Tongjiang Yan

In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several explicit constructions of self-orthogonal and self-dual codes are presented, from which quantum stabilizer codes are further derived. Finally, some corresponding examples are given, especially that some of these codes are MDS, AMDS or NMDS and that some of the resulting quantum stabilizer codes are optimal, achieving the quantum Singleton bound.

Hang Yi, Tongxuan Bie, Tongjiang Yan

As the Internet grows in popularity, more and more classification jobs, such as IoT, finance industry and healthcare field, rely on mobile edge computing to advance machine learning. In the medical industry, however, good diagnostic accuracy necessitates the combination of large amounts of labeled data to train the model, which is difficult and expensive to collect and risks jeopardizing patients' privacy. In this paper, we offer a novel medical diagnostic framework that employs a federated learning platform to ensure patient data privacy by transferring classification algorithms acquired in a labeled domain to a domain with sparse or missing labeled data. Rather than using a generative adversarial network, our framework uses a discriminative model to build multiple classification loss functions with the goal of improving diagnostic accuracy. It also avoids the difficulty of collecting large amounts of labeled data or the high cost of generating large amount of sample data. Experiments on real-world image datasets demonstrates that the suggested adversarial federated transfer learning method is promising for real-world medical diagnosis applications that use image classification.

Tao Wang, Tongjiang Yan, Shiwen Sun

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, a new method for construct quantum synchronizable codes from negacyclic codes are proposed, where the length of these negacyclic codes are $p$ and $pq$. Through this method, the quantum synchronizable code possesses optimal or almost optimal error-correcting capability towards bits errors and phase errors, since the negacyclic codes we used are optimal or almost optimal. Moreover, this paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.

Tao Wang, Tongjiang Yan, Vladimir Sidorenko et al.

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. This paper contributes to constructing two classes of quantum synchronizable codes by the cyclotomic classes of order two over $\mathbb{Z}_{2q}$, whose synchronization capabilities can reach the upper bound under certain conditions. Moreover, the quantum synchronizable codes possess good error-correcting capability towards bit errors and phase errors.

Pengcheng Ren, Tongjiang Yan

A decentralized federated learning architecture is proposed to apply to the Businesses-to-Businesses scenarios by introducing the consortium blockchain in this paper. We introduce a model verification mechanism to ensure the quality of local models trained by participators. To analyze the latency of the system, a latency model is constructed by considering the work flow of the architecture. Finally the experiment results show that our latency model does well in quantifying the actual delays.

Tao Wang, Tongjiang Yan, Xueting Wang

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, the quantum synchronizable codes constructed are CSS quantum error-correcting codes whose synchronization capabilities reach the upper bound. And we use cyclic codes gained by sextic cyclotomic classes to construct two classes of quantum synchronizable codes. Moreover, the quantum synchronizable codes are posses good error-correcting capability towards bit error and phase error, since the cyclic codes we used are optimal or almost optimal.

Ming Yan, Tongjiang Yan, Yu Li

This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.

Shidong Zhang, Tongjiang Yan

The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period $4N$ with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period $N$. In this paper, we use the interleaving technique to construct a binary sequence with the optimal autocorrelation of period $2N$, then we calculate its autocorrelation values and its distribution, and give a lower bound of linear complexity. Results show that these sequences have low autocorrelation and the linear complexity satisfies the requirements of cryptography.

Yu Li, Tongjiang Yan, Chuan Lv

Compared with the perfect complementary sequence sets, quasi-complementary sequence sets (QCSSs) can support more users to work in multicarrier CDMA communications. A near-optimal periodic QCSS is constructed in this paper by using an optimal quaternary sequence set and an almost difference set. With the change of the values of parameters in the almost difference set, the near-optimal QCSS can become asymptotically optimal and the number of users supported by the subcarrier channels in CDMA system has an exponential growth.

Tongjiang Yan, Guang Gong

Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low autocorrelations are presented.