Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$

@article{Chen2006ReducingTC,
  title={Reducing the Computation of Linear Complexities of Periodic Sequences Over \$\{\hbox \{GF\}\}(p^m)\$},
  author={Hao Chen},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={5537-5539}
}
  • Hao Chen
  • Published 2006 in IEEE Transactions on Information Theory
The linear complexity of a periodic sequence over GF(pm) plays an important role in cryptography and communication (see Menezes, van Oorschort, and Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1997). In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of a period un sequence over GF(pm) to the computation of the linear complexities and minimal connection polynomials of u period n sequences. The… CONTINUE READING