On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1307.6626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive character sums of polynomial quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fermat quotients for composite moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions derived from Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the divisibility of Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short character sums with Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity of binary threshold sequences derived from Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity of Binary Sequences Derived from Polynomial Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Pseudorandom Numbers Derived from Fermat Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation of Fermat Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of binary sequences derived from Euler quotients with prime-power modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 𝑝-divisibility of Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative character sums of Fermat quotients and pseudorandom sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and Dynamics of Fermat Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHARACTER SUMS WITH FERMAT QUOTIENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value set of Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fermat quotients: exponential sums, value set and primitive roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace representation and linear complexity of binary sequences derived from Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many bits have to be changed to decrease the linear complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability theory of stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the k-error linear complexity of cyclotomic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Error Linear Complexity over F p of Sidelnikov Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search for Wieferich and Wilson primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation polynomials, de Bruijn sequences, and linear complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the Error Linear Complexity Spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of generalized cyclotomic binary sequences of order 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autocorrelation values of generalized cyclotomic sequences of order two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400352 / rank
 
Normal rank

Latest revision as of 15:47, 30 July 2024

scientific article; zbMATH DE number 7609600
Language Label Description Also known as
English
On the k-error linear complexity of binary sequences derived from polynomial quotients
scientific article; zbMATH DE number 7609600

    Statements

    On the k-error linear complexity of binary sequences derived from polynomial quotients (English)
    0 references
    0 references
    0 references
    0 references
    28 October 2022
    0 references
    0 references
    0 references
    0 references

    Identifiers