Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences

DOI10.1007/BF02831818zbMath1156.94434OpenAlexW1980606267MaRDI QIDQ3443217

Fengxiang Zhu, Wen-Feng Qi

Publication date: 1 June 2007

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02831818

zbMATH Keywords

linear complexity\(k\)-error linear complexity\(pq^n\)-periodic binary sequences

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How many bits have to be changed to decrease the linear complexity?
• The stability theory of stream ciphers
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• A relationship between linear complexity and k-error linear complexity

This page was built for publication: Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences