On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p

Chenhuang Wu; Vladimir Edemskiy; Chunxiang Xu

doi:10.1109/access.2020.2980311

IEEE Access (Jan 2020)

On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p

Chenhuang Wu,
Vladimir Edemskiy,
Chunxiang Xu

Affiliations

Chenhuang Wu: ORCiD; School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
Vladimir Edemskiy: ORCiD; Department of Applied Mathematics and Information Science, Novgorod State University, Veliky Novgorod, Russia
Chunxiang Xu: ORCiD; School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

DOI: https://doi.org/10.1109/access.2020.2980311
Journal volume & issue: Vol. 8
pp. 51477 – 51481

Abstract

Read online

This work was supported in part by the Projects of International Cooperation and Exchange National Natural Science Foundation of China and the Russian Foundation for Basic Research (NSFC-RFBR) under Grant 61911530130, in part by the National Natural Science Foundation of China under Grant 61373140. The work of Vladimir Edemskiy was supported by the RFBR-NSFC according to the research project under Grant 19-51-53003. The work of Chunxiang Xu was supported in part by the National Natural Science Foundation of China under Grant 61872060, in part by the National Key Research and Development Program of China under Grant 2017YFB0802000, and in part by the Key Laboratory of Financial Mathematics of Fujian Province University (Putian University) under Grant JR201901.

Published in IEEE Access

ISSN: 2169-3536 (Online)
Publisher: IEEE
Country of publisher: United States
LCC subjects: Technology: Electrical engineering. Electronics. Nuclear engineering
Website: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639

About the journal

Abstract

Keywords