An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform

Alexandra Alecu, Ana Salagean. An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform. In Frank R. Kschischang, En-Hui Yang, editors, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, July 6-11, 2008. pages 2414-2418, IEEE, 2008. [doi]

Abstract

Abstract is missing.