Linear Complexity of the Balanced Polynomial Quotients Sequences
Zhao Chun-e, Yan Tongjiang, Niu Qihua
MATEC Web of Conferences · 2018
doi:10.1051/matecconf/201822801014 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.