Pseudorandomness of binary sequences derived from linear recursions (Q313462): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10998-015-0085-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Measures of pseudorandomness for finite sequences: typical values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear recursion and pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pseudorandom binary sequences using additive characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pseudorandom binary lattices based on multiplicative characters / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10998-015-0085-0 / rank
 
Normal rank

Latest revision as of 16:18, 8 December 2024

scientific article
Language Label Description Also known as
English
Pseudorandomness of binary sequences derived from linear recursions
scientific article

    Statements

    Pseudorandomness of binary sequences derived from linear recursions (English)
    0 references
    0 references
    9 September 2016
    0 references
    The author considers well-distribution and correlation measures for binary se- quences defined via linear recurrences over finite fields and Legendre symbols. It is shown that the well-distribution measures are small and that the correlation measures of these sequences are small for small correlation orders. The proofs are based on character sum estimates.
    0 references
    pseudorandomness
    0 references
    pseudorandom measures
    0 references
    linear recursion
    0 references

    Identifiers