Summary
The k-error linear complexity of periodic sequences is a natural generalization of the linear complexity which is one of important measures for pseudorandom sequences. In this paper, we give a relation between the minimum decrease and the zero sum property for sequences over GF(p m) with period p n, where p is a prime. Moreover the parity of the decrease set in case of binary sequences with period 2 n is shown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Massey J.L. (1969) Shift register synthesis and BCH decoding. IEEE Trans, on Information Theory. IT-15, 122–127.
Stamp M., Martin C.F. (1993) An algorithm for the terror linear complexity of binary sequences with period 2n. IEEE Trans, on Information Theory. 39, 1398–1401.
Ding C., Xiao G., Shan W. (1991) The Stability Theory of Stream Ciphers. Lecture Notes in Compute Science, 561, Springer-Verlag.
Kaida T., Uehara S., Imamura K. (1999) An algorithm for the k-error linear complexity of sequences over GF(pm) with period p n, p a prime. Information and Computation. 151, Academic Press, 134–147.
Kaida T., Uehara S., Imamura K. (1999) A new algorithm for the k-error linear complexity of sequences over GF(p m) with period p n. Sequences and their Applications. Springer-Verlag, 284–296.
Uehara S., Imamura K. (1996) Linear complexity of periodic sequences obtained from GF(q) sequences with period q n-1 by one-symbol insertion. IEICE Trans, on Fundamentals. 79-A, 1739–1740.
Kurosawa K., Sato F., Sakata T., Kishimoto W. (2000) A relationship between linear complexity and k-error linear complexity. IEEE Trans, on Information Theory. 46, 694–698.
Massey J.L., Costello D.J., Justesen J. (1973) Polynomial weight and code construction, IEEE Trans, on Information Theory. IT-19, 101–110.
Chan A.H., Games R.A., Key E.L. (1982) On the complexities of de Bruijn sequences, Journal of Combinatorial Theory, Series A, 33, 233–246.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this paper
Cite this paper
Kaida, T., Uehara, S., Imamura, K. (2002). On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n . In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0673-9_16
Publisher Name: Springer, London
Print ISBN: 978-1-85233-529-8
Online ISBN: 978-1-4471-0673-9
eBook Packages: Springer Book Archive