Some algorithms for the error linear complexity of binary 2 n -periodic sequences

DOI10.1007/S11859-013-0891-2zbMath1299.94079OpenAlexW1992343414MaRDI QIDQ5400126

Zuling Chang, Li Duan, Xue-yuan Wang

Publication date: 28 February 2014

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

Full work available at URL: https://doi.org/10.1007/s11859-013-0891-2

zbMATH Keywords

spectrumbinary sequenceerror linear complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• FLIP: A method for adaptively zoned, particle-in-cell calculations of fluid flows in two dimensions
• The stability theory of stream ciphers
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• 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/
• A relationship between linear complexity and k-error linear complexity
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Properties of the Error Linear Complexity Spectrum

This page was built for publication: Some algorithms for the error linear complexity of binary 2 n -periodic sequences