Yanbin Zheng

IT
3papers
7citations
Novelty40%
AI Score35

3 Papers

17.6ITApr 7
Non-GRS type MDS and AMDS codes from extended TGRS codes

Meiying Zhang, Shudi Yang, Yanbin Zheng

Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent error-correcting capabilities. In this paper, we construct a class of extended twisted generalized Reed-Solomon (TGRS) codes and determine the necessary and sufficient conditions for these codes to be MDS or AMDS. Additionally, we prove that these codes are not equivalent to generalized Reed-Solomon (GRS) codes. As an application, under certain circumstances, we compute the covering radii and deep holes of these codes.

LGMar 4, 2021
Dynamic Efficient Adversarial Training Guided by Gradient Magnitude

Fu Wang, Yanghao Zhang, Yanbin Zheng et al.

Adversarial training is an effective but time-consuming way to train robust deep neural networks that can withstand strong adversarial attacks. As a response to its inefficiency, we propose Dynamic Efficient Adversarial Training (DEAT), which gradually increases the adversarial iteration during training. We demonstrate that the gradient's magnitude correlates with the curvature of the trained model's loss landscape, allowing it to reflect the effect of adversarial training. Therefore, based on the magnitude of the gradient, we propose a general acceleration strategy, M+ acceleration, which enables an automatic and highly effective method of adjusting the training procedure. M+ acceleration is computationally efficient and easy to implement. It is suited for DEAT and compatible with the majority of existing adversarial training techniques. Extensive experiments have been done on CIFAR-10 and ImageNet datasets with various training environments. The results show that the proposed M+ acceleration significantly improves the training efficiency of existing adversarial training methods while achieving similar robustness performance. This demonstrates that the strategy is highly adaptive and offers a valuable solution for automatic adversarial training.

ITNov 19, 2018
A Note on Two Constructions of Zero-Difference Balanced Functions

Zongxiang Yi, Yuyin Yu, Chunming Tang et al.

Notes on two constructions of zero-difference balanced (ZDB) functions are made in this letter. Then ZDB functions over $\mathbb{Z}_{e}\times \prod_{i=0}^{k}{\mathbb{F}_{q_i}}$ are obtained. And it shows that all the known ZDB functions using cyclotomic cosets over $\mathbb{Z}_{n}$ are special cases of a generic construction. Moreover, applications of these ZDB functions are presented.