The linear complexity of binary sequences with period (2/sup n/-1)/sup k/

DOI10.1109/18.79929zbMath0764.11050OpenAlexW2076609286MaRDI QIDQ3981580

Guozhen Xiao, Cheng Hua

Publication date: 26 June 1992

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

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

zbMATH Keywords

shift registerlower bound of linear complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

This page was built for publication: The linear complexity of binary sequences with period (2/sup n/-1)/sup k/