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

DOI10.1109/TIT.2007.907442MaRDI QIDQ3549099zbMATHOpenAlexFDO

Authors Konstantinos Limniotis, Nicholas Kolokotronis, N. Kalouptsidis

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2007.907442

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Descriptive complexity and finite models (68Q19)

Cited in

(5)

• On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)
• Multisequences with high joint nonlinear complexity
• Novel way to research nonlinear feedback shift register
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Improved transformation between Fibonacci FSRs and Galois FSRs based on semi-tensor product

This page was built for publication: On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549099)