On the linear complexity of nonuniformity decimated PN-sequences

DOI10.1109/18.21235MaRDI QIDQ3816018zbMATH OpenOpenAlexFDO

Authors Miodrag Živković, J. 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

binary linear feedback shift registerlinear complexitylower bound

Mathematics Subject Classification ID

Communication, information (94A99)

Recommendations

• scientific article; zbMATH DE number 1024087
• On the linear complexity of nonlinearly filtered pn-sequences
• scientific article; zbMATH DE number 26870
• Periods of interleaved and nonuniformly decimated sequences
• A note on nonuniform decimation of periodic sequences

Cited in

(6)

• Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences
• On the linear complexity of feedforward clock-controlled sequence
• Periods of interleaved and nonuniformly decimated sequences
• A note on nonuniform decimation of periodic sequences
• A cryptanalysis of clock-controlled shift registers with multiple steps
• On period of multiplexed sequences

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

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