Abstract
The k-error linear complexity of an N-periodic sequence with terms in the finite field \({\mathbb{F}_q}\) is defined to be the smallest linear complexity that can be obtained by changing k or fewer terms of the sequence per period. For the case that N = pfl p is an odd prime,and q is a primitive root modulo p2, we show a relationship between the linear complexity and the minimum value of k for which the k-error linear complexity is strictly less than the linear complexity.
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.
References
J. von zur Gathen and J. Gerhard Modern Computer Algebra. Cambridge University Press, Cambridge, 1999.
D. Jungnickel Finite Fields: Structure and Arithmetics. Bibliographisches Institut, Mannheim, 1993.
K. Kurosawa, F. Sato, T. Sakata and W. Kishimoto, A relationship between linear complexity and k-error linear complexity. IEEE Trans. Inform. Theory 46 (2000), 694–698.
R. Lidl and H. Niederreiter Finite Fields. Reading, MA: Addison-Wesley,1983.
J.H. van Lint Introduction to coding theory. 3rd Edition, Graduate texts in Mathematics, 86. Springer-Verlag, Berlin, 1999.
W. Meidl How many bits have to be changed to decrease the linear complexity? Des. Codes Cryptogr., to appear.
W. Meidl and H. Niederreiter Linear complexity k-error linear complexity and the discrete Fourier transform. J. Complexity 18 (2002), 87–103.
W. Meidl and H. Niederreiter Periodic sequences with maximal linear complexity and large k-error linear complexity. AAECC 14 (2003), 273–286.
H. Niederreiter Some computable complexity measures for binary sequences. Sequences and Their Applications (C. Ding, T. Helleseth and H. Niederreiter, Eds.),67–78, Springer, London, 1999.
K.H Rosen Elementary Number Theory and its Applications. Reading, MA: Addison-Wesley, 1988.
R.A. Rueppel Analysis and Design of Stream Ciphers Springer, Berlin, 1986.
R.A. Rueppel Stream ciphers. Contemporary Cryptology: The Science of Information Integrity (G.J. Simmons, Ed.), 65–134, IEEE Press, New York, 1992.
D. Shanks Solved and Unsolved Problems in Number Theory. 2nd Edition, Chelsea Publishing Company, New York, 1978.
M. Stamp and C. F. Martin An algorithm for the k-error linear complexity of binary sequences with period 2’. IEEE Trans. Inform. Theory 39 (1993), 1398–1401.
H.C.A. van Tilborg, An Introduction to Cryptology. Kluwer Acad. Publ., Boston, 1988.
S. Wei, G. Xiao and Z. Chen, An Efficient Algorithm for k-Error Linear Complexity. Chinese Journal of Electronics 11(2) (2002), 265–267.
G. Xiao, S. Wei, K.Y. Lam and K. Imamura, A fast algorithm for determining the linear complexity of a sequence with period pfl over GF(q). IEEE Trans. Inform. Theory 46 (2000), 2203–2206.
G. Xiao, S. Wei Fast algorithms for determining the linear complexity of period sequences. Progress in Cryptology — INDOCRYPT 2002 (A. Menezes and P. Sarkar, Eds.), Lecture Notes in Computer Science 2551, 12–21, Springer-Verlag, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Meidl, W. (2004). Linear Complexity and k-Error Linear Complexity for p n -Periodic Sequences. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_15
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive