On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q610285
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Matthew J. B. Robshaw / rank
 
Normal rank

Revision as of 23:48, 19 February 2024

scientific article
Language Label Description Also known as
English
On evaluating the linear complexity of a sequence of least period \(2^ n\)
scientific article

    Statements

    On evaluating the linear complexity of a sequence of least period \(2^ n\) (English)
    0 references
    0 references
    4 September 1994
    0 references
    0 references
    feedback shift register
    0 references
    algorithm
    0 references
    linear complexity
    0 references