Brought to you by:
Paper • The following article is Open access

On k-error linear complexity over ${\mathbb{F}}$N of interleaved binary sequences derived from four N-periodic ones

, and

Published under licence by IOP Publishing Ltd
, , Citation V Edemskiy et al 2019 J. Phys.: Conf. Ser. 1352 012012 DOI 10.1088/1742-6596/1352/1/012012

Download Article PDF

Article metrics

80 Total downloads

Share this article

Author e-mails

Vladimir.Edemsky@novsu.ru

Author affiliations

1 Yaroslav-the-Wise Novgorod State University, ul. B. St. Petersburgskaya, 41 173003 Veliky Novgorod, Russia

2 College of Mathematics and Statistics, Northwest Normal University, Lanzhou, Gansu 730070, P.R. China

3 School of Mathematics, Putian University, Putian, Fujian 351100, P.R. China

Buy this article in print

Journal RSS
Sign up for new issue notifications
1742-6596/1352/1/012012

Abstract

We estimate the k-error linear complexity of some interleaved sequences with period 4N over the finite field of order N (N an odd prime). Furthermore, we obtain the exact value of the k-error linear complexity for small value of k of the interleaved sequences obtained from the cyclotomic sequences. In particular, we study the interleaved sequences obtained from Legendre sequences and Hall's sextic residue sequences, respectively. Our results show that these sequences are quite stable.

Export citation and abstract BibTeX RIS

Previous article in issue
Next article in issue

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

A post-publication change was made to this article on 15 Jan 2020 to correct a grant number in the Acknowledgments.

Please wait… references are loading.
10.1088/1742-6596/1352/1/012012