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
Citations are not available for this document.
Cites in Papers - |
Cites in Papers - IEEE (2)
Select All
1.
Honggang Hu, Guang Gong, Dengguo Feng, "New Results on Periodic Sequences With Large $k$-Error Linear Complexity", IEEE Transactions on Information Theory, vol.55, no.10, pp.4687-4694, 2009.
2.
Shaoquan Jiang, Zongduo Dai, K. Imamura, "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, vol.46, no.3, pp.1174-1177, 2000.
Cites in Papers - Other Publishers (9)
1.
Minghui YANG, Dongdai LIN, Minjia SHI, "Minimum Linear Complexity Approximation of Sequences with Period qn-1 over Fq", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E97.A, no.12, pp.2667, 2014.
2.
Ramakanth Kavuluru, Andrew Klapper, "Lower bounds on error complexity measures for periodic LFSR and FCSR sequences", Cryptography and Communications, vol.1, no.1, pp.95, 2009.
3.
Ramakanth Kavuluru, Andrew Klapper, Progress in Cryptology – INDOCRYPT 2007, vol.4859, pp.322, 2007.
4.
Deng-Guo Feng, Xiao-Yun Wang, "Progress and Prospect of Some Fundamental Research on Information Security in China", Journal of Computer Science and Technology, vol.21, no.5, pp.740, 2006.
5.
Lihua Dong, Yong Zeng, Yupu Hu, Computational Intelligence and Security, vol.3802, pp.68, 2005.
6.
Takayasu Kaida, Sequences and Their Applications - SETA 2004, vol.3486, pp.166, 2005.
7.
Harald Niederreiter, "Linear Complexity and Related Complexity Measures for Sequences", Progress in Cryptology - INDOCRYPT 2003, vol.2904, pp.1, 2003.
8.
Takayasu Kaida, Satoshi Uehara, Kyoki Imamura, Sequences and their Applications, pp.284, 1999.
9.
Takayasu Kaida, Satoshi Uehara, Kyoki Imamura, "An Algorithm for the k-Error Linear Complexity of Sequences over GF(pm) with Period pn, p a Prime", Information and Computation, vol.151, no.1-2, pp.134, 1999.