On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences

DOI10.1109/TIT.2007.907442zbMath1326.94063MaRDI QIDQ3549099

Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

94A60: Cryptography

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68Q19: Descriptive complexity and finite models

Related Items

Multisequences with high joint nonlinear complexity, Binary sequences with period \(N\) and nonlinear complexity \(N - 2\), Novel way to research nonlinear feedback shift register