A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences (Q438884)

From MaRDI portal
Revision as of 17:03, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q124812679, #quickstatements; #temporary_batch_1722355380754)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
scientific article

    Statements

    A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences (English)
    0 references
    31 July 2012
    0 references
    periodic sequence
    0 references
    linear complexity
    0 references
    \(k\)-error linear complexity
    0 references
    0 references

    Identifiers