Issue |
MATEC Web Conf.
Volume 228, 2018
2018 3rd International Conference on Circuits and Systems (CAS 2018)
|
|
---|---|---|
Article Number | 01014 | |
Number of page(s) | 4 | |
Section | Intelligent Computing and Information Processing | |
DOI | https://doi.org/10.1051/matecconf/201822801014 | |
Published online | 14 November 2018 |
Linear Complexity of the Balanced Polynomial Quotients Sequences
College of Sciences, China University of Petroleum, Qingdao 266555, China
Balanced binary sequences of large linear complexity have series applications in communication systems. In the past, although the sequences derived from polynomial quotients have large linear complexity, but they are not balanced. In this paper, we will construct new sequences which are not only with large linear complexity but also balanced. Meanwhile, this linear complexity reaches the known k-error linear complexity mentioned in [7], which means that the k-error linear complexity as a lower bound is tight.
© The Authors, published by EDP Sciences, 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.