On the Linear Complexity of Sequences Obtained by State Space Generators

DOI10.1109/TIT.2008.917639zbMATH Open1328.94058OpenAlexW2154364581MaRDI QIDQ3604535FDOQ3604535

N. Kalouptsidis, Nicholas Kolokotronis, Konstantinos Limniotis

Publication date: 24 February 2009

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial codes (94B25)

Cited In (1)

• Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers

This page was built for publication: On the Linear Complexity of Sequences Obtained by State Space Generators

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