On the nonlinear complexity and Lempel-Ziv complexity of finite length sequences

IEEE Transactions on Information Theory

Volumn 53, Issue 11, 2007, Pages 4293-4302

  Limniotis, Kontantinos ^a   Kolokotronis, Nicholas ^a   Kalouptsidis, Nicholas ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

Compression; Cryptography; Eigenvalue; Lempel Ziv complexity; Nonlinear complexity; Nonlinear feedback shift registers; Sequences

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; EIGENVALUES AND EIGENFUNCTIONS; SHIFT REGISTERS;

LEMPEL-ZIV COMPLEXITY; NONLINEAR COMPLEXITY; NONLINEAR FEEDBACK SHIFT REGISTERS;

INFORMATION THEORY;

EID: 36349010333     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.907442     Document Type: Article

References (28)

1. S. W. Golomb, Shift Register Sequences. San Francisco, CA: Holden-Day, 1967.
2. N. Kalouptsidis, "Signal processing systems," in Telecommunications and Signal Processing Series. New York: Wiley, 1996.
3. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1996.
4. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
5. J. L. Massey, "Shift register synthesis and BCH decoding," IEEE Trans. Inf. Theory, vol. IT-15, no. 1, pp. 122-127, 1969.
6. E. L. Key, "An analysis of the structure and complexity of nonlinear binary sequence generators," IEEE Trans. Inf. Theory, vol. IT-22, no. 6, pp. 732-736, 1976.
7. R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin, Germany: Springer-Verlag, 1986.
8. J. L. Massey and S. Serconek, "A Fourier transform approach to the linear complexity of nonlinearly filtered sequences," in Adv. Cryptology-CRYPTO '94, Berlin, Germany, 1994, vol. 839, Lecture Notes in Computer Science, pp. 332-340.
9. J. L. Massey and S. Serconek, "Linear complexity of periodic sequences: A general theory," in Adv. Cryptology-CRYPTO '96, Berlin, Germany, 1996, vol. 1109, Lecture Notes in Computer Science, pp. 358-371.
10. N. Kolokotronis and N. Kalouptsidis, "On the linear complexity of non-linearly filtered PN-sequences," IEEE Trans. Inf. Theory, vol. 49, no. 11, pp. 3047-3059, 2003.
11. K. Limniotis, N. Kolokotronis, and N. Kalouptsidis, "New results on the linear complexity of binary sequences," in Proc. IEEE Int. Symp. Inf. Theory, 2006, pp. 2003-2007.
12. N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, "Lower bounds on sequence complexity via generalized Vandermode determinants," in Sequences and Their Applications, Berlin, Germany, 2006, vol. 4086, pp. 271-284.
13. C. J. A. Jansen, "Investigations on Nonlinear Streamcipher Systems: Construction and Evaluation Methods," Ph.D. dissertation, Technical University of Delft, Delft, The Netherlands, 1989.
14. C. J. A. Jansen and D. E. Boekee, "The shortest feedback shift register that can generate a given sequence," in Adv. Cryptology-CRYPTO '89 Berlin, Germany, 1990, vol. 435, Lecture Notes in Computer Science, pp. 90-99.
15. C. J. A. Jansen, "The maximum order complexity of sequence ensembles," in Adv. Cryptology-Eurocrypt '91, Berlin, Germany, 1991, vol. 547, Lecture Notes in Computer Science, pp. 153-159.
16. D. Erdmann and S. Murphy, "An approximate distribution for the maximum order complexity," Des. Codes Cryptogr., vol. 10, no. 3, pp. 325-339, 1997.
17. P. Rizomiliotis and N. Kalouptsidis, "Results on the nonlinear span of binary sequences," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1555-1563, 2005.
18. P. Rizomiliotis, N. Kolokotronis, and N. Kalouptsidis, "On the quadratic span of binary sequences," IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1840-1848, 2005.
19. P. Rizomiliotis, "Constructing periodic binary sequences of maximum nonlinear span," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4257-4261, 2006.
20. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inf. Theory, vol. IT-22, no. 1, pp. 75-81, 1976.
21. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inf. Theory, vol. IT-23, no. 3, pp. 337-343, 1977.
22. J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inf. Theory, vol. IT-24, no. 5, pp. 530-536, 1978.
23. A. D. Wyner and J. Ziv, "The sliding-window Lempel-Ziv algorithm is asymptotically optimal," Proc. IEEE, vol. 82, pp. 872-877, 1994.
24. H. Niederreiter, "Some computable complexity measures for binary sequences," in Sequences and Their Applications, Discrete Mathematics and Theoretical Computer Science, 1999, pp. 67-78.
25. K. Limniotis, N. Kolokotronis, and N. Kalouptsidis, "Nonlinear complexity of binary sequences and connections with Lempel-Ziv compression," in Sequences and Their Applications, Berlin, Germany, 2006, vol. 4086, pp. 168-179.
26. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1978.
27. S. Stergiou, D. Voudouris, and G. Papakonstantinou, "Multiple-value exclusive-or sum-of-products minimization algorithms," IEICE Trans. Fund., vol. E.87-A, no. 5, pp. 1226-1234, 2004.
28. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.