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]
@inproceedings{AlecuS08,
title = {An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform},
author = {Alexandra Alecu and Ana Salagean},
year = {2008},
doi = {10.1109/ISIT.2008.4595424},
url = {http://dx.doi.org/10.1109/ISIT.2008.4595424},
researchr = {https://researchr.org/publication/AlecuS08},
cites = {0},
citedby = {0},
pages = {2414-2418},
booktitle = {2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, July 6-11, 2008},
editor = {Frank R. Kschischang and En-Hui Yang},
publisher = {IEEE},
isbn = {978-1-4244-2256-2},
}