Hao Chen. Fast algorithms for determining the linear complexity of sequences over GF(p/sup m/) with period 2/sup t/n. IEEE Transactions on Information Theory, 51(5):1854-1856, 2005. [doi]
@article{Chen05:16,
title = {Fast algorithms for determining the linear complexity of sequences over GF(p/sup m/) with period 2/sup t/n},
author = {Hao Chen},
year = {2005},
doi = {10.1109/TIT.2005.846443},
url = {http://dx.doi.org/10.1109/TIT.2005.846443},
researchr = {https://researchr.org/publication/Chen05%3A16},
cites = {0},
citedby = {0},
journal = {IEEE Transactions on Information Theory},
volume = {51},
number = {5},
pages = {1854-1856},
}