Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
From MaRDI portal
Publication:3541919
DOI10.1007/11863854_14zbMath1152.94391OpenAlexW1511103811MaRDI QIDQ3541919
Konstantinos Limniotis, Nicholas Kalouptsidis, Nicholas Kolokotronis
Publication date: 27 November 2008
Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11863854_14
Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Multisequences with high joint nonlinear complexity ⋮ Composition of recursions and nonlinear complexity of periodic binary sequences ⋮ Factorization of determinants over finite fields and application in stream ciphers