An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform
From MaRDI portal
Publication:3588585
DOI10.1007/978-3-642-15874-2_12zbMath1257.94025OpenAlexW1986108729MaRDI QIDQ3588585
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
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Numerical methods for discrete and fast Fourier transforms (65T50) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items