The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity (Q3541911)

From MaRDI portal
Revision as of 18:20, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
scientific article

    Statements

    The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2008
    0 references
    stream cipher systems
    0 references
    periodic sequences
    0 references
    linear complexity
    0 references
    \(k\)-error linear complexity
    0 references
    counting function
    0 references
    fast algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references