Reducing the Computation of Linear Complexities of Periodic Sequences over $GF(p^m)$

Hao Chen

The linear complexity of a periodic sequence over $GF(p^m)$ plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces…