Fast algorithms for determining the linear complexity of sequences over GF(p/sup m/) with period 2/sup t/n

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]

Abstract

Abstract is missing.