An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform

DOI10.1007/978-3-642-15874-2_12zbMath1257.94025MaRDI QIDQ3588585

Ana Sălăgean, Alexandra Alecu

Publication date: 8 September 2010

Published in: Sequences and Their Applications – SETA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15874-2_12

zbMATH Keywords

discrete Fourier transform; linear complexity; periodic sequences; \(k\)-error linear complexity

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

65T50: Numerical methods for discrete and fast Fourier transforms

94-04: Software, source code, etc. for problems pertaining to information and communication theory