Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period

IEEE Transactions on Information Theory

Volumn 46, Issue 3, 2000, Pages 1174-1177

  Jiang, Shaoquan ^a   Dai, Zongduo ^a   Imamura, Kyoki ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; LINEAR SYSTEMS; NUMERICAL METHODS; RANDOM PROCESSES; SET THEORY;

LINEAR COMPLEXITY; PERIODIC SEQUENCE;

INFORMATION THEORY;

EID: 0034188616     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.841203     Document Type: Article

References (5)

1. Z. Dai and K. Imamura, "Linear complexity for one-symbol substitution of a periodic sequence over GF(g)," IEEE Trans. Inform. Theory, vol. 44, pp. 1328-1331, May 1998.
2. n -1 by one-symbol insertion," IEICE Trans. Fundamentals, vol. E79-A, pp. 1739-1740, Oct. 1996.
3. n -1 by one-symbol deletion," IEICE Trans. Fundamentals, vol. E80-A, pp. 1164-1166, June 1997.
4. D. Ye and Z. Dai, "Linear complexity of periodic sequences under two symbol substitutions," in Advances in Cryptology-China Crypto'96. Beijing, China: Science Press, pp. 7-9. in Chinese.
5. S. Uehara and K. Imamura, "Linear complexities of periodic sequences obtained from an m-sequence by two-symbol substitution," in Proc. 1998 Int. Symp. Information Theory and Its Applications (ISITA'98), Mexico City, Mexico, Oct. 1998, pp. 690-692.