참고문헌
-
R. A. Games and A. H. Chan, "A fast algorithm for determining the complexity of a binary sequence with period
$2^{n}$ ," IEEE Trans. Inform. Theory, vol. 29, no. 1, pp. 144-146, Jan 1983 https://doi.org/10.1109/TIT.1983.1056619 - S. W. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park Press, 1982
- S. W. Golomb and G. Gong, Signal Design for Good Correlation: for wireless communications, cryptography and radar applications. Cambridge University Press, 2005
- K. Imamura, T. Moriuchi, and S. Uehara, "Periodic sequences of the maximum linear complexity simply obtained from an m-sequence," in Proc. IEEE 1991 Inter. Symp. Inform. Theory, June 1991, pp. 175
- S. Jiang, Z. Dai, and K. Imamura, "Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period," IEEE Trans. Inform. Theory, vol. 46, no. 3, pp. 1174-1177, May 2000 https://doi.org/10.1109/18.841203
- P. V. Kumar and V. K. Wei, "Minimum distance of logarithmic and fractional partial m-sequences," IEEE Trans. Inform. Theory, vol. 38, no. 5, pp. 1474-1482, Sep. 1992 https://doi.org/10.1109/18.149498
- K. Kurosawa, F. Sato, T. Sakata, and W. Kishimoto, "Relationship between linear complexity and k-error linear complexity," IEEE Trans. Inform. Theory, vol. 46, no. 3, pp. 694-698, Mar. 2000 https://doi.org/10.1109/18.825845
-
M. Stamp and C. Martin, "An algorithm for the k-error linear complexity of binary sequences with period
$2^{n}$ ," IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1398-1401, July 1993 https://doi.org/10.1109/18.243455 -
S. Uehara and K. Imamura, "Linear complexity of periodic sequences obtained from GF(p) sequences with period
$q^{n}$ -1 by one-symbol insertion," IEICE Trans. Fund., vol. E79-A, no. 10, pp. 1739-1740, Oct. 1996