Some Upper Bounds and Exact Values on Linear Complexities Over F M of Sidelnikov Sequences for M = 2 and 3

DOI10.1109/TIT.2022.3167097MaRDI QIDQ5097007zbMATHOpenAlexFDO

Authors Min Zeng, Yuan Luo, Guosheng Hu, Hong-Yeop Song

Publication date 19 August 2022

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

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

Mathematics Subject Classification ID

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

This page was built for publication: Some Upper Bounds and Exact Values on Linear Complexities Over F _M of Sidelnikov Sequences for M = 2 and 3

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