On the k-error linear complexity of binary sequences derived from polynomial quotients

DOI10.1007/S11432-014-5220-7zbMATH Open1497.94067arXiv1307.6626OpenAlexW2282058484MaRDI QIDQ5046474FDOQ5046474

Authors: Zhixiong Chen, Zhihua Niu, Chenhuang Wu 

Publication date: 28 October 2022

Published in: Science China Information Sciences (Search for Journal in Brave)

Abstract: We investigate the $k$-error linear complexity of $p^2$-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by ${\displaystyle }$ q_{p,w}(u)equiv frac{u^w-u^{wp}}{p} �mod p ~ mathrm{with} 0 le q_{p,w}(u) le p-1, ~uge 0, ${\displaystyle }$ where $p$ is an odd prime and $1lew<p$. Indeed, first for all integers $k$, we determine exact values of the $k$-error linear complexity over the finite field $F_2$ for these binary sequences under the assumption of f2 being a primitive root modulo $p^2$, and then we determine their $k$-error linear complexity over the finite field $F_p$ for either $0lek<p$ when $w=1$ or $0lek<p-1$ when $2lew<p$. Theoretical results obtained indicate that such sequences possess `good' error linear complexity.

Full work available at URL: https://arxiv.org/abs/1307.6626

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Permutation polynomials, de Bruijn sequences, and linear complexity
• The stability theory of stream ciphers
• Linear complexity of generalized cyclotomic binary sequences of order 2
• On the divisibility of Fermat quotients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Autocorrelation values of generalized cyclotomic sequences of order two
• Shift-register synthesis and BCH decoding
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• How many bits have to be changed to decrease the linear complexity?
• A search for Wieferich and Wilson primes
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
• Fermat quotients for composite moduli
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
• Bounds of multiplicative character sums with Fermat quotients of primes
• Pseudorandomness and dynamics of Fermat quotients
• Character sums with Fermat quotients
• Fermat quotients: exponential sums, value set and primitive roots
• Structure of Pseudorandom Numbers Derived from Fermat Quotients
• On the 𝑝-divisibility of Fermat quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• Multiplicative character sums of Fermat quotients and pseudorandom sequences
• On the value set of Fermat quotients
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• On the k-error linear complexity of cyclotomic sequences
• Properties of the Error Linear Complexity Spectrum
• Short character sums with Fermat quotients
• Additive character sums of polynomial quotients
• Boolean functions derived from Fermat quotients
• Title not available (Why is that?)
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
• Linear Complexity Over&lt;tex&gt;$F_p$&lt;/tex&gt;of Sidel'nikov Sequences
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
• Linear complexity of binary sequences derived from polynomial quotients
• Interpolation of Fermat quotients
• On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
• 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
• Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
• One-Error Linear Complexity over F p of Sidelnikov Sequences

Cited In (5)

• On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
• Trace representation of pseudorandom binary sequences derived from Euler quotients
• Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
• On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
• A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)

This page was built for publication: On the k-error linear complexity of binary sequences derived from polynomial quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046474)