Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
Tor Helleseth, Sang‐Hyo Kim, Jong‐Seon No · IEEE Transactions on Information Theory · 2003
In this article, the linear complexity over F/sub p/ of Lempel-Cohn-Eastman (1977) sequences of period p/sup m/-1 for an odd prime p is determined. For p=3,5, and 7, the exact closed-form expressions for the linear complexity over F/sub p/ of LCE sequences of period p/sup m/-1 are derived. Further, the trace representations for LCE sequences of period p/sup m/-1 for p=3 and 5 are found by computing the values of all Fourier coefficients in F/sub p/ for the sequences.