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

@article{Chen2005FastAF,
  title={Fast algorithms for determining the linear complexity of sequences over GF(p/sup m/) with period 2/sup t/n},
  author={Hao Chen},
  journal={IEEE Transactions on Information Theory},
  year={2005},
  volume={51},
  pages={1854-1856}
}
We prove a result which reduces the computation of the linear complexity of a sequence over GF(p<sup>m</sup>) (p is an odd prime) with period 2n (n is a positive integer such that there exists an element bisinGF(p<sup>m</sup>), b<sup>n</sup>=-1) to the computation of the linear complexities of two sequences with period n. By combining with some known… CONTINUE READING