Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution (Q3789478): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-39118-5_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1542275631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Functions of Linear Shift Register Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of binary sequences with controllable complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois Switching Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Complexity of Combined Shift Register Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Difference Sets / rank
 
Normal rank

Latest revision as of 17:30, 18 June 2024

scientific article
Language Label Description Also known as
English
Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
scientific article

    Statements

    Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution (English)
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    key stream generator
    0 references
    linear feedback shift register
    0 references
    primitive connection polynomial
    0 references
    nonlinear feedforward logic
    0 references
    0 references