An algorithm fork-error joint linear complexity of binary multisequences

DOI10.1080/09720529.2008.10698185zbMath1183.94017OpenAlexW1984137807MaRDI QIDQ3542554

No author found.

Publication date: 1 December 2008

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2008.10698185

zbMATH Keywords

Multisequences\(k\)-error joint linear complexitybalanced multisequences.

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\)

Cites Work

• Unnamed Item
• Error linear complexity measures for multisequences
• The stability theory of stream ciphers
• The expected value of the joint linear complexity of periodic multisequences
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
• A construction ofp-ary balanced sequence with largek-error linear complexity
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/

This page was built for publication: An algorithm fork-error joint linear complexity of binary multisequences