Binary sequences with length n and nonlinear complexity not less than n/2

DOI10.1109/TIT.2023.3316252MaRDI QIDQ6575606zbMATH OpenFDO

Authors Sicheng Liang, Xiangyong Zeng, Zibi Xiao, Zhimin Sun

Publication date 21 July 2024

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

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

zbMATH Keywords

finite-length binary sequencesnonlinear complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

This page was built for publication: Binary sequences with length \(n\) and nonlinear complexity not less than \(n/2\)

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