On the linear complexity of nonuniformity decimated PN-sequences

DOI10.1109/18.21235zbMath0664.94014OpenAlexW2064301354MaRDI QIDQ3816018

Miodrag Živković, Jovan Dj. Golić

Publication date: 1989

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

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

zbMATH Keywords

lower boundlinear complexitybinary linear feedback shift register

Mathematics Subject Classification ID

Communication, information (94A99)

Related Items (4)

On the linear complexity of feedforward clock-controlled sequence ⋮ A note on nonuniform decimation of periodic sequences ⋮ A cryptanalysis of clock-controlled shift registers with multiple steps ⋮ Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences

This page was built for publication: On the linear complexity of nonuniformity decimated PN-sequences