2.7k citations
- Chinese Academy of SciencesCN296 papers
- University of Chinese Academy of SciencesCN142 papers
- State Key Laboratory of Information Security44 papers
- Beihang UniversityCN26 papers
- Tsinghua UniversityCN19 papers
- Institute of Computing TechnologyCN15 papers
- Sun Yat-sen UniversityCN13 papers
- Peking UniversityCN11 papers
- Alibaba Group (China)CN10 papers
- Renmin University of ChinaCN10 papers
- Nanyang Technological UniversitySG9 papers
- Peng Cheng LaboratoryCN8 papers
16 papers · 1 filter
On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation
Minghui Yang, Shiyuan Qiang, Xiaoyan Jing +2
In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period and with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282…
Some classes of power functions with low c-differential uniformity over finite fields
Zhengbang Zha, Lei Hu
Functions with low c-differential uniformity have optimal resistance to some types of differential cryptanalysis. In this paper, we investigate the c-differential uniformity of pow…
On the 2-adic complexity of a class of binary sequences of period with optimal autocorrelation magnitude
Minghui Yang, Lulu Zhang, Keqin Feng
Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed…
Constructions of involutions over finite fields
Dabin Zheng, Mu Yuan, Nian Li +2
An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications s…
Nonexistence of generalized bent functions and the quadratic norm form equations
Chang Lv, Yuqing Zhu
We present a new result on the nonexistence of generalized bent functions (GBFs)from (Z/tZ)^n to Z/tZ (called type [n, t]) for a large class. Assume p is an odd prime number. By sh…
On deep-holes of Gabidulin codes
Weijun Fang, Li-Ping Wang, Daqing Wan
In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient…