Abstract:
It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of ...Show MoreMetadata
Abstract:
It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of the sequence.
Published in: IEEE Transactions on Information Theory ( Volume: 44, Issue: 3, May 1998)
DOI: 10.1109/18.669427
References is not available for this document.
Select All
1.
K. Imamura, T. Moriuchi and S. Uehara, " Periodic sequences of the maximum linear complexity simply obtained from an m -sequence ", Proc. IEEE 1991 Int. Symp. Information Theory, pp. 175, June 1991.
2.
K. Imamura and G. Xiao, " On periodic sequences of the maximum linear complexity and m -sequences ", Proc. ISITA 1992, pp. 1219-1221, Nov. 1992.
3.
K. Imamura, S. Uehara and T. Moriuchi, "GF(q) sequences of period q^n-1 with maximum linear complexity and maximum order complexities for minimum changes of m -sequences ", Proc. IEEE 1994 Int. Symp. Information Theory, pp. 366, June 1994.
4.
W. H. Mills, "Continued fractions and linear recurrences", Math. Comp., vol. 29, pp. 173-180, 1975.
5.
Z. D. Dai, X. N. Feng, M. L. Liu and Z. X. Wan, " Nonlinear feedforward sequences of m -sequences I ", Discr. Math., vol. 123, pp. 17-34, 1993.